3.5 Concurrent and Lock-Free Structures

Mutex-protected structures, lock-free stacks, queues, hash tables, skip lists, CAS primitives, hazard pointers, epoch reclamation, and RCU.

3.5 Concurrent and lock-free structures, 35

index slug name
1 concurrent-data-structure Concurrent Data Structure
2 thread-safe-wrapper Thread Safe Wrapper
3 mutex-protected-map Mutex Protected Map
4 read-write-lock-map Read Write Lock Map
5 striped-locking Striped Locking
6 concurrent-queue Concurrent Queue
7 mpsc-queue MPSC Queue
8 spmc-queue SPMC Queue
9 mpmc-queue MPMC Queue
10 bounded-concurrent-queue Bounded Concurrent Queue
11 unbounded-concurrent-queue Unbounded Concurrent Queue
12 lock-free-stack Lock Free Stack
13 lock-free-queue Lock Free Queue
14 lock-free-list Lock Free List
15 lock-free-hash-table Lock Free Hash Table
16 lock-free-skip-list Lock Free Skip List
17 wait-free-structure Wait Free Structure
18 obstruction-free-structure Obstruction Free Structure
19 compare-and-swap Compare And Swap
20 load-linked-store-conditional Load Linked Store Conditional
21 aba-problem ABA Problem
22 tagged-pointer Tagged Pointer
23 hazard-pointer Hazard Pointer
24 epoch-based-reclamation Epoch Based Reclamation
25 read-copy-update Read Copy Update
26 memory-ordering Memory Ordering
27 linearizability Linearizability
28 progress-guarantee Progress Guarantee
29 concurrent-skip-list Concurrent Skip List
30 concurrent-bag Concurrent Bag
31 work-stealing-deque Work Stealing Deque
32 flat-combining Flat Combining
33 elimination-backoff-stack Elimination Backoff Stack
34 concurrent-invariant-check Concurrent Invariant Check
35 concurrent-benchmarking Concurrent Benchmarking