The ERA Theorem for Safe Memory Reclamation

DOI10.1145/3583668.3594564arXiv2211.04351OpenAlexW4380881578WikidataQ130953085 ScholiaQ130953085MaRDI QIDQ6202230

Unnamed Author, Erez Petrank

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.04351

zbMATH Keywords

robustnessconcurrencylock-freedomsafe memory reclamation

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Impossibility of distributed consensus with one faulty process
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• Lock-free reference counting
• Nesting-Safe Recoverable Linearizability
• Verifying Concurrent Memory Reclamation Algorithms with Grace
• Upper and Lower Bounds on the Space Complexity of Detectable Objects

This page was built for publication: The ERA Theorem for Safe Memory Reclamation