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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 8; H. PLDI; S. 2174 - 2198
Hauptverfasser:	Nikolaev, Ruslan, Ravindran, Binoy
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 20.06.2024
Schlagworte:	Concurrent algorithms Shared memory algorithms Theory of computation wait-free memory reclamation hazard pointers
ISSN:	2475-1421, 2475-1421
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!