Concurrency

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 Go runtime with garbage collector threads.

Efficient Garbage Collection for Concurrent Go Programs

A deep dive into Go’s garbage collector, focusing on concurrency, performance tuning, and practical patterns for production services.

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.

Diagram of a lockless queue with multiple threads accessing it.

A Formal Verification Strategy for Concurrent Lockless Queues

A practical guide to formally verifying lockless concurrent queues, from theory to tool‑supported implementations.

Diagram of a B-Tree node being duplicated on write.

Why Copy on Write B-Trees Improve Database Concurrency

Copy‑on‑write B‑trees enable high‑concurrency database operations by allowing readers to see a stable snapshot while writers modify a new version of the tree. The article explains the underlying mechanics, performance benefits, and practical implementation tips.