Every data structure deserves lock-free memory reclamation
Open Access
- 24 October 2018
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 2 (OOPSLA) , 1-24
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.Keywords
All Related Versions
This publication has 35 references indexed in Scilit:
- Reclaiming Memory for Lock-Free Data Structures2015
- ThreadScan2015
- Efficient Memory Management for Lock-Free Data Structures with Optimistic Access2015
- Wait-free linked-lists2012
- A methodology for creating fast wait-free data structures2012
- Performance of memory reclamation for lockless synchronizationJournal of Parallel and Distributed Computing, 2007
- Stopless2007
- Hazard pointers: safe memory reclamation for lock-free objectsIEEE Transactions on Parallel and Distributed Systems, 2004
- Lock-free garbage collection for multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1992
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991