Lock-free by Example
summary
Shows how to design and implement a multi-producer, multi-consumer lock-free circular queue in C++, one that grows and shrinks and stays mostly contiguous. Uses this single, intricate example to expose common lock-free programming problems and compares different solutions and trade-offs for those problems.
AI-written summary · about
chapters (4)
related talks
57mDesigning an SPSC Lock free queue
53mIntroduction to Lock-free Programming
52mBest Practices for Concurrency
59mThreads and Locks must Go
01h 05mIntroduction to Wait-free Algorithms in C++ Programming
01h 02mA Lock-Free Atomic Shared Pointer in Modern Cpp
01h 07mAn Introduction to Multithreading in C++20
05mC++ Koans