awesome_concurrency

Awesome Concurrency

Return to Awesome, Concurrency

awesome-concurrency

Libraries (libs.md)

Memory consistency models

Examples

C++

Rust

Java

Go

LLVM

Atomics impl

Futures

Fibers

Coroutines

Stackless

Asymmetric Transfer

Stacks

Channels

Asynchronous Programming

Async / await

- C#: [Механика asnyc/await в C#]] - https://habr.com/ru/post/260217/) - Kotlin: [Coroutines / Implementation details]] - https://github.com/Kotlin/KEEP/blob/master/proposals/coroutines.md#implementation-details) - C++: [Understanding operator co_await]] - https://lewissbaker.github.io/2017/11/17/understanding-operator-co-await), [Understanding the promise type]] - https://lewissbaker.github.io/2018/09/05/understanding-the-promise-type)

Syntax

Structured Concurrency

Cancellation

Data race detection

Verification

Tools

Fearless Concurrency

Consistency models for concurrent objects

Lock-freedom

Data Structures / Algorithms

Memory Management

Misc

Transactions

Demystifying Database Systems

Hardware Transactional Memory

Fair Use Sources

Concurrency: Concurrency Programming Best Practices, Concurrent Programming Fundamentals, Parallel Programming Fundamentals, Asynchronous I/O, Asynchronous programming (Async programming, Asynchronous flow control, Async / await), Asymmetric Transfer, Akka, Atomics, Busy waiting, Channels, Concurrent, Concurrent system design, Concurrency control (Concurrency control algorithms‎, Concurrency control in databases, Atomicity (programming), Distributed concurrency control, Data synchronization), Concurrency pattern, Concurrent computing, Concurrency primitives, Concurrency problems, Concurrent programming, Concurrent algorithms, Concurrent programming languages, Concurrent programming libraries‎, Java Continuations, Coroutines, Critical section, Deadlocks, Decomposition, Dining philosophers problem, Event (synchronization primitive), Exclusive or, Execution model (Parallel execution model), Fibers, Futures, Inter-process communication, Linearizability, Lock (computer science), Message passing, Monitor (synchronization), Computer multitasking (Context switch, Pre-emptive multitasking - Preemption (computing), Cooperative multitasking - Non-preemptive multitasking), Multi-threaded programming, Multi-core programming, Multi-threaded, Mutual exclusion, Mutually exclusive events, Mutex, Non-blocking algorithm (Lock-free), Parallel programming, Parallel computing, Process (computing), Process state, Producer-consumer problem (Bounded-buffer problem), Project Loom, Promises, Race conditions, Read-copy update (RCU), Readers–writer lock, Readers–writers problem, Recursive locks, Reducers, Reentrant mutex, Scheduling (computing)‎, Semaphore (programming), Seqlock (Sequence lock), Serializability, Shared resource, Sleeping barber problem, Spinlock, Synchronization (computer science), System resource, Thread (computing), Tuple space, Volatile (computer programming), Yield (multithreading), Concurrency bibliography, Manning Concurrency Async Parallel Programming Series, Concurrency glossary, Awesome Concurrency, Concurrency topics, Functional programming. (navbar_concurrency - see also navbar_async, navbar_python_concurrency, navbar_golang_concurrency, navbar_java_concurrency)


© 1994 - 2024 Cloud Monk Losang Jinpa or Fair Use. Disclaimers

SYI LU SENG E MU CHYWE YE. NAN. WEI LA YE. WEI LA YE. SA WA HE.


awesome_concurrency.txt · Last modified: 2024/05/01 04:32 by 127.0.0.1

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki