Interval-based memory reclamation
Authors:
Open Access
- 10 February 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Abstract
No abstract availableKeywords
Funding Information
- US National Science Foundation (CNS-1319417, CCF-1337224, CCF-1422649, CCF-1717712)
- Google, Inc. (Faculty Research Award)
This publication has 21 references indexed in Scilit:
- Reclaiming Memory for Lock-Free Data Structures2015
- ThreadScan2015
- Efficient Memory Management for Lock-Free Data Structures with Optimistic Access2015
- Scalable address spaces using RCU balanced trees2012
- Performance of memory reclamation for lockless synchronizationJournal of Parallel and Distributed Computing, 2007
- Nonblocking memory management support for dynamic-sized data structuresACM Transactions on Computer Systems, 2005
- Hazard pointers: safe memory reclamation for lock-free objectsIEEE Transactions on Parallel and Distributed Systems, 2004
- Lock-free linked lists using compare-and-swap1995
- A methodology for implementing highly concurrent data objectsACM Transactions on Programming Languages and Systems, 1993
- Making data structures persistent1986