2 related articles

An in-depth look at the core design challenges of MPMC queues: bounded waiting, lock-free mechanisms, sequence-number slots, dual-path strategies, and helping. Helping engineers balance throughput, fairness, and latency.

A deep dive into building high-performance lock-free queues with modern C++, covering CAS atomic operations, memory ordering, Michael-Scott algorithm, ring buffers, ABA problem solutions, and memory reclamation mechanisms.