Every data structure deserves lock-free memory reclamation

23Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cases, requires redesigning the data structure. In this paper, we present the first lock-free memory-management scheme that is applicable to general (arbitrary) lock-free data structures and that can be applied automatically via a compiler plug-in. In addition to the simplicity of incorporating to data structures, this scheme provides low overhead and does not rely on the lock freedom of any OS services.

References Powered by Scopus

Wait-Free Synchronization

1297Citations
N/AReaders
Get full text

Hazard pointers: Safe memory reclamation for lock-free objects

373Citations
N/AReaders
Get full text

A pragmatic implementation of non-blocking linked-lists

324Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Efficient lock-free durable sets

47Citations
N/AReaders
Get full text

Universal wait-free memory reclamation

21Citations
N/AReaders
Get full text

NBR: Neutralization based reclamation

20Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Cohen, N. (2018). Every data structure deserves lock-free memory reclamation. Proceedings of the ACM on Programming Languages, 2(OOPSLA). https://doi.org/10.1145/3276513

Readers over time

‘18‘19‘20‘21‘22‘23‘2402468

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 7

78%

Professor / Associate Prof. 1

11%

Researcher 1

11%

Readers' Discipline

Tooltip

Computer Science 12

100%

Save time finding and organizing research with Mendeley

Sign up for free
0