Non-blocking algorithm
A non-blocking algorithm, also called non-blocking synchronization, is a concurrent algorithm in which a delayed or failed process cannot prevent others from completing, typically built from atomic primitives like compare-and-swap.
Producer–consumer problem
The producer–consumer problem, also called the bounded-buffer problem, is a classic concurrent programming problem in which producers fill a shared buffer that consumers drain, requiring synchronization.
Readers–writers problem
The readers–writers problem is a classical concurrency problem, posed in 1971 by Courtois, Heymans, and Parnas, in which readers share a resource while writers need exclusive access.
Spinlock
A spinlock is a mutual exclusion lock where a waiting thread busy-waits by repeatedly checking the lock, efficient for critical sections shorter than a context switch.