@inproceedings{c3881775538b43adb9e3cff9e1733e37,
title = "POSTER: 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 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 Owner/Author.; 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023 ; Conference date: 25-02-2023 Through 01-03-2023",
year = "2023",
month = feb,
day = "25",
doi = "10.1145/3572848.3577491",
language = "الإنجليزيّة",
series = "Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP",
pages = "435--437",
booktitle = "PPoPP 2023 - Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming",
}