Concurrent Immediate Reference Counting
summary
A new system, Concurrent Immediate Reference Counting, combines reference counting with SMR (EBR) to record a decrement EPO per object and use a global epoch clock to decide safety. It records EPOs on decrements and pointer stores so zero-count objects can be reclaimed recursively and immediately instead of piling up. Implementation in Rust shows memory stays stable (comparable to EBR) and throughput matches EBR for reads while adding only small overheads on update-heavy workloads; artifacts and benchmarks are available.
AI-written summary · about
chapters (11)
- 0:00Concurrent memory reclamation intro
- 1:05Safe memory reclamation algorithms
- 2:50Reference counting alternative
- 4:15Deferred RC approach
- 6:03Garbage chains in deferred RC
- 6:45Concurrent IRC key idea
- 8:09Epoch clocks for safety
- 9:34Decrement epochs in CIR
- 11:01Recursive decrement with epochs
- 13:50Experimental results summary
- 14:30Q&A
related talks
20mIntroduction to Epoch-Based Memory Reclamation
20mRRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures
19mDesigning Wait-free Weak Reference Counting
19mConcurrent Mutation must go
19mReference Counting Deeply Immutable Data Structures with Cycles
55m“A lock-free concurrency toolkit for deferred reclamation and optimistic speculation"
01h 08mRead, Copy, Update, then what? RCU for non-kernel programmers
58m“The Landscape and Exciting New Future of Safe Reclamation for High Performance”