The ERA Theorem for Safe Memory Reclamation

Gali Sheffi, Erez Petrank

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment