Wait-free memory reclamation and data structures
summary
Presents WFE (Wait-Free Eras) as a universal wait‑free memory reclamation that extends Hazard Eras with a fast-path slow-path get_protected plus helper protocol, per‑thread state and tags, requiring CAS and FAA (and optional 16‑byte CAS). Implements helper-rescue before advancing the global epoch so get_protected is wait‑free. Evaluation on a 96‑core testbed (24‑core CPUs, GCC 8.3) shows similar throughput to other schemes while avoiding EBR’s memory blowup after many threads and keeping memory bounded; code is on GitHub.
AI-written summary · about
chapters (6)
- 0:00Start
- 4:32RECLAMATION PROBLEM
- 5:18LOCK-FREE STACK
- 12:13SED RECLAMATION (EBR)
- 20:08HAZARD POINTERS' API
- 23:12TION OF EBR AND HAZARD POINTERS
related talks
21mA Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation
20mIntroduction to Epoch-Based Memory Reclamation
21mEvery Data Structure Deserves Lock-Free Memory Reclamation
36mImplementing wait-free space bounded shared memory primitives on concurrent systems
55m“A lock-free concurrency toolkit for deferred reclamation and optimistic speculation"
58m“The Landscape and Exciting New Future of Safe Reclamation for High Performance”
19mDesigning Wait-free Weak Reference Counting
01h 06m“How to make your data structures wait-free for reads"