The ERA Theorem for Safe Memory Reclamation

11/08/2022
by   Gali Sheffi, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset