Oh My Learning

The Art of Multiprocessor Programming

13 lessons · 0/13 discussed · baseline senior

01 Concurrency model and shared-memory assumptions 9 min read mid drafted 02 Mutual exclusion and lock correctness criteria 8 min read mid drafted 03 Classic lock algorithms (Peterson, bakery, tournament) 9 min read senior drafted 04 Scalable locks (TAS, TTAS, CLH, MCS, backoff) 10 min read senior drafted 05 Linearizability and correctness of concurrent objects 9 min read senior drafted 06 Concurrent linked lists and skip lists 10 min read senior drafted 07 Progress guarantees: obstruction-free, lock-free, wait-free 9 min read senior drafted 08 Universal constructions with consensus primitives 9 min read staff drafted 09 Consensus hierarchy and synchronization power 9 min read staff drafted 10 Atomic primitives (CAS, FAA) and ABA hazards 10 min read senior drafted 11 Lock-free stacks and queues 11 min read senior drafted 12 Memory reclamation (hazard pointers, epochs) 11 min read staff drafted 13 Software transactional memory and composable synchronization 10 min read senior drafted