Implementing Work-Stealing Runtimes: Building a Lock-Free Scheduler from Scratch
A deep dive into lock-free work-stealing schedulers, covering the theory, architecture, and a minimal implementation in Rust.
Lock-Free
Architecting a Lock-Free Scheduler for High-Throughput Actor Systems in Rust
Exploring lock-free scheduler design patterns for high-throughput actor systems in Rust, with real-world pitfalls and performance benchmarks.
Designing Lock-Free Queues: Inside the Linux KFIFO and Ringbuffer Implementations
How the Linux kernel’s KFIFO achieves a wait-free, lock-free FIFO with a single atomic variable. We walk through the ringbuffer math, the memory-ordering subtlety that makes it correct on weakly ordered CPUs, and what you can borrow for your own high-throughput pipelines.
Hidden Memory Hazards in Lock-Free Data Structures
A deep dive into hidden memory hazards in lock‑free structures, with examples, diagnostics, and mitigation techniques for reliable concurrent code.
How Epoch-Based Reclamation Avoids the Stalled Pointer Problem
A deep dive into epoch‑based reclamation, showing why it solves the stalled pointer issue and how to apply it safely in high‑performance concurrent code.