A step-by-step build guide for a from-scratch caching library inspired by Google Guava’s cache. You’ll implement LRU eviction, TTL expiration, concurrent access, and observability — a CV project that signals real distributed-systems engineering skill.
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.
Path compression dramatically speeds up Union-Find operations by collapsing intermediate nodes during finds, turning deep trees into almost flat structures.
A deep dive into lock striping, revealing how it reduces contention in concurrent hash maps and how to apply it effectively.
We dissect the mechanics of cuckoo hashing, derive worst‑case chain length bounds, and present engineering tricks that prevent long eviction cascades.