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

page 1

page 2

page 3

page 4

research
01/07/2020

Universal Wait-Free Memory Reclamation

In this paper, we present a universal memory reclamation scheme, Wait-Fr...
research
02/25/2023

Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures

Safe memory reclamation (SMR) algorithms are crucial for preventing use-...
research
12/17/2017

A new and five older Concurrent Memory Reclamation Schemes in Comparison (Stamp-it)

Memory management is a critical component in almost all shared-memory, c...
research
11/28/2018

Safe Deferred Memory Reclamation with Types

Memory management in lock-free data structures remains a major challenge...
research
10/25/2018

Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis

Verification of concurrent data structures is one of the most challengin...
research
04/12/2022

Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting

Safe memory reclamation (SMR) schemes are an essential tool for lock-fre...
research
01/26/2018

White-box methodologies, programming abstractions and libraries

This deliverable reports the results of white-box methodologies and earl...

Please sign up or login with your details

Forgot password? Click here to reset