Series
Lock-free data structures in Rust
3 parts
Part 12 min
Writing a lock-free queue from scratch
The ABA problem, pointer tagging, and CAS — by building it in Rust.
Part 22 min
Reclaiming memory: hazard pointers vs epochs
Once the queue works, the hard part begins — freeing nodes safely.
Part 32 min
Memory ordering in practice (not the spec)
Acquire, release, and when Relaxed is actually fine on hot paths.