Tag
lock-free-reads
- 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 1, 2024 Seqlocks: Consistent Reads Without Reader-Side Writes How an even/odd sequence counter lets readers detect a concurrent update, why the read side must be free of side effects, and what the retry cost looks like under write-heavy load. systems programming