A Family of Fast and Memory Efficient Lock- and Wait-Free Reclamation

Historically, memory management based on lock-free reference counting was very inefficient, especially for read-dominated workloads. Thus, approaches such as epoch-based reclamation (EBR), hazard pointers (HP), or a combination thereof have received significant attention. EBR exhibits excellent perf...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 8; no. PLDI; pp. 2174 - 2198
Main Authors:	Nikolaev, Ruslan, Ravindran, Binoy
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 20.06.2024
Subjects:	Concurrent algorithms Shared memory algorithms Theory of computation wait-free memory reclamation hazard pointers
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!