Parallel - gusenov/kb GitHub Wiki
- Linda Language ("coordination language")
- wiki.c2.com/?SynchronizationStrategies
- Concurrency Freaks
- Left-Right: A Concurrency Control Technique with Wait-Free Population Oblivious Reads by Pedro Ramalhete (Cisco Systems), Andreia Correia
- Modeling Condition Variables using Formal Methods introduction to condition variable usage using TLA+ / PlusCal to formally model it: A parent and child process waiting on each other.
- YouTube
- freeCodeCamp.org
Books
- Parallel and High Performance Computing by Robert Robey and Yuliana Zamora - 704 pages
Wikipedia
- Template:Parallel computing
- Category:Concurrent computing
- Category:Concurrent programming languages
- Load balancing (computing)
- π-calculus is a process calculus. The π-calculus allows channel names to be communicated along the channels themselves, and in this way it is able to describe concurrent computations whose network configuration may change during the computation.
- Concurrency control ensures that correct results for concurrent operations are generated, while getting those results as quickly as possible.
- AoS and SoA refer to contrasting ways to arrange a sequence of records in memory, with regard to interleaving, and are of interest in SIMD and SIMT programming.
- Vectorization
- Array programming a style of computer programming where operations are applied to whole arrays instead of individual elements
- Instruction-level parallelism (ILP) is the parallel or simultaneous execution of a sequence of instructions in a computer program.
- Category:SIMD computing
- Readers–writer lock is a synchronization primitive that solves one of the readers–writers problems.
- Readers–writers problem are examples of a common computing problem in concurrency.
- Template:Concurrent computing
- Map (parallel pattern) is an idiom in parallel computing where a simple operation is applied to all elements of a sequence, potentially in parallel.
- Flynn's taxonomy
- Single instruction, multiple data
- Bulk synchronous parallel (BSP) abstract computer is a bridging model for designing parallel algorithms.
- Semaphore (programming) is a variable or abstract data type used to control access to a common resource by multiple threads and avoid critical section problems in a concurrent system such as a multitasking operating system.