Tag
rcu
- Jun 21, 2026 Concurrent Readers on a Mutating Trie Lookups traverse many dependent loads, so per-node locking is untenable. How publish-then-swap, deferred reclamation, and path copying keep readers safe while nodes grow and split. data structures
- May 7, 2026 Radix Trees over Fixed-Width Integer Keys Indexing by bit fields instead of by bytes turns a trie into a fixed-height array of tables. Why integer radix trees need no rebalancing, how their height is computed, and where they lose to hash tables. data structures
- Apr 10, 2025 The Linux Kernel Memory Model and Its Tooling How LKMM formalises READ_ONCE, smp_mb, and RCU into an executable model, what its relation set adds to the architecture models, and where it deliberately diverges from C11. memory systems