Scalable lock-free dynamic memory allocation
Author:
Open Access
- 9 June 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 39 (6) , 35-46
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Hazard pointers: safe memory reclamation for lock-free objectsIEEE Transactions on Parallel and Distributed Systems, 2004
- Split-ordered lists2003
- High performance dynamic lock-free hash tables and list-based sets2002
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writes2002
- Mostly lock-free malloc2002
- Hoard2000
- Shared memory consistency models: a tutorialComputer, 1996
- False sharing and spatial locality in multiprocessor cachesIEEE Transactions on Computers, 1994
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Concurrent reading and writingCommunications of the ACM, 1977