In this paper, we present a universal memory reclamation scheme, Wait-Free Eras (WFE), for deleted memory blocks in wait-free concurrent data structures. WFE’s key innovation is that it is completely wait-free. Although some techniques provide similar guarantees for certain data structures, they lack support for arbitrary wait-free data structures. Consequently, developers are typically forced to marry their wait-free data structures with lock-free Hazard Pointers or (potentially blocking) epoch-based memory reclamation. Since both these schemes provide weaker progress guarantees, they essentially forfeit the strong progress guarantees of wait-free data structures. Though making the original Hazard Pointers scheme or epoch-based reclamation completely wait-free seems infeasible, we achieved this goal with a more recent, (lock-free) Hazard Eras scheme which we extend to guarantee wait-freedom. As this extension is non-trivial, we discuss all challenges pertaining to the construction of universal wait-free memory reclamation.
WFE is implementable on ubiquitous x86_64 and AArch64 (ARM) architectures. Its API is mostly compatible with Hazard Pointers, which allows easy transitioning of existing data structures into WFE. Our experimental evaluations show that WFE’s performance is close to epoch-based reclamation and almost matches the original Hazard Eras scheme, while providing stronger progress guarantees.
Mon 24 FebDisplayed time zone: Tijuana, Baja California change
14:00 - 15:40
|Scaling Concurrent Queues by Using HTM to Profit from Failed Atomic Operations|
|A Wait-Free Universal Construct for Large Objects|
|Fast Concurrent Data Sketches|
|Universal Wait-Free Memory Reclamation|