3 related articles

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.

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.
C++ Asymmetric Memory Barriers: Princi…
A deep dive into C++ asymmetric memory barriers: core principles, Linux membarrier syscall, compiler vs hardware fences, and engineering applications in RCU and lock-free data structures.