Lock-Free

Illustration of a circular buffer with atomic pointers.

The Mechanics of Thread Safety in Lockless Circular Buffers

A deep dive into lockless circular buffer design, showing how atomic primitives, memory fences, and careful indexing keep multiple producers and consumers safe without locks.

Illustration of a binary heap with atomic arrows indicating lock‑free operations.

Implementing Lock-Free Priority Queues Using Compare and Swap

A deep dive into lock‑free priority queues, explaining the compare‑and‑swap technique, data‑structure choices, correctness proofs, and real‑world benchmarks.

Illustration of a concurrent queue with colored hazard pointers.

How Lock‑Free Queues Handle Memory Reclamation via Hazard Pointers

A deep dive into hazard pointers for lock‑free queues, showing why they matter, how they work, and when to use them over alternative reclamation schemes.

Illustration of a hash map with multiple threads accessing buckets without locks.

Designing Lock-Free Concurrent Hash Maps Without Atomic Contention

A deep dive into lock‑free hash map designs that sidestep atomic contention, covering bucket partitioning, versioned pointers, and practical performance results.

Illustration of two threads exchanging data atomically.

Solving Data Races with Lock‑Free Atomic Compare‑and‑Swap

A deep dive into lock‑free programming using atomic compare‑and‑swap, covering theory, implementation patterns, and real‑world best practices.