@inproceedings{87ce9620ec074eb288bcdcc345a62603,
title = "The ERA Theorem for Safe Memory Reclamation",
abstract = "Safe memory reclamation (SMR) schemes for concurrent data structures offer trade-offs between three desirable properties: ease of integration, robustness, and applicability. In this paper we rigorously define SMR and these three properties, and we present the ERA theorem, asserting that any SMR scheme can only provide at most two of the three properties.",
keywords = "concurrency, lock-freedom, robustness, safe memory reclamation",
author = "Gali Sheffi and Erez Petrank",
note = "Publisher Copyright: {\textcopyright} 2023 ACM.; 42nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2023 ; Conference date: 19-06-2023 Through 23-06-2023",
year = "2023",
month = jun,
day = "19",
doi = "10.1145/3583668.3594564",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "102--112",
booktitle = "PODC 2023 - Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing",
}