Tag
memory-reclamation
- Sep 11, 2026 Lock-Free Linked Lists and the Reclamation Problem Compare-and-swap can insert and delete on a singly linked list without locks, but freeing a removed node requires hazard pointers or epoch tracking to stop reuse. data structures
- 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
- Jul 24, 2025 Memory Reclamation for Lock-Free Structures Hazard pointers, epoch-based reclamation, and reference counting compared by what they cost on the read path, when memory is actually returned, and which failure they tolerate. systems programming
- Dec 7, 2024 Thread-Local Caches and the Cost of a Remote Free Why per-thread free lists remove contention from malloc, what a free on the wrong thread must do, and how ownership transfer and rebalancing keep the design from stranding memory. memory systems
- Aug 18, 2024 Lock-Free Reclamation: ABA, Tagged Pointers, and Hazard Pointers Why a compare-and-swap pop can succeed against a pointer that was freed and reused, and what tagging, hazard pointers, and epoch schemes each cost to close that hole. operating systems