Tag
lock-free
- Sep 11, 2026 Lock-Free Linked Lists and the Reclamation Problem Compare-and-swap can insert and delete on a singly linked list without locks, but freeing a removed node requires hazard pointers or epoch tracking to stop reuse. data structures
- May 16, 2026 Compare-and-Swap and Why the Retry Loop Must Re-read How a conditional store becomes a universal synchronisation primitive, why weak compare-and-exchange may fail spuriously, and what makes a CAS loop terminate. systems programming
- Sep 2, 2025 Progress Guarantees and the Lock-Free Hierarchy The difference between obstruction-free, lock-free, and wait-free, why lock-free does not mean no locks, and how helping makes a single-word operation wait-free. systems programming
- Jul 14, 2025 The ABA Problem in Treiber Stacks Why a single compare-and-swap suffices to push onto a Treiber stack but not to pop from it, what the address comparison cannot detect, and which remedies actually close the window. systems programming
- Sep 16, 2024 Descriptor Rings and the Producer-Consumer Contract How a ring buffer carries work from a driver to a device without locks, what the ownership bit buys, and why the wrap-around index is the hard part. computer architecture
- Aug 18, 2024 Lock-Free Reclamation: ABA, Tagged Pointers, and Hazard Pointers Why a compare-and-swap pop can succeed against a pointer that was freed and reused, and what tagging, hazard pointers, and epoch schemes each cost to close that hole. operating systems
- Nov 26, 2023 Compare-and-Swap Retry Loops Under Contention Why a lock-free read-modify-write loop that is faster than a mutex with two threads is slower with twenty, and how to bound, batch, or replace the retry. performance engineering