Safe memory reclamation for dynamic lock-free objects using atomic reads and writes

DOI10.1145/571825.571829zbMath1292.68035OpenAlexW2127976210MaRDI QIDQ5170862

Maged M. Michael

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/571825.571829

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)

Related Items (6)

A general lock-free algorithm using compare-and-swap ⋮ Parallel implementations of Brunotte's algorithm ⋮ Lock-free deques and doubly linked lists ⋮ Markov fundamental tensor and its applications to network analysis ⋮ A scalable lock-free stack algorithm ⋮ NB{\texttt{malloc}}: Allocating memory in a lock-free manner

This page was built for publication: Safe memory reclamation for dynamic lock-free objects using atomic reads and writes