Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures.
Durable concurrent data structures for non-volatile memories are essential building blocks …

This monograph grows out of nearly 40 years of experience in synchronization and
concurrent data structures. Though written primarily from the perspective of systems …

Safe memory reclamation (SMR) algorithms suffer from a trade-off between bounding
unreclaimed memory and the speed of reclamation. Hazard pointer (HP) based algorithms …

Safe lock-free memory reclamation is a difficult problem. Existing solutions follow three basic
methods: epoch based reclamation, hazard pointers, and optimistic reclamation. Epoch …

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 …

Reclaiming memory in non-blocking dynamic data structures in unmanaged languages like
C/C++ presents a unique challenge due to the risk of use-after-free errors caused by …

Dynamic lock-free data structures require a memory reclamation scheme with a similar
progress. Until today, lock-free schemes are applied to data structures on a case-by-case …

All pointer-based nonblocking concurrent data structures should deal with the problem of
safe memory reclamation: before reclaiming a memory block, a thread should ensure no …

Hazard pointers is a popular semi-manual memory reclamation scheme for concurrent data
structures, where each accessing thread announces protection of each object to access and …

Safe memory reclamation (SMR) schemes for concurrent data structures offer trade-offs
between three desirable properties: ease of integration, robustness, and applicability. In this …