PREPRINT

The ERA Theorem for Safe Memory Reclamation

Gali Sheffi and Erez Petrank

Submitted on 8 November 2022

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.

Preprint

Subject: Computer Science - Distributed, Parallel, and Cluster Computing

URL: http://arxiv.org/abs/2211.04351