Lock-free reference counting
- 1 August 2001
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 190-199
- https://doi.org/10.1145/383962.384016
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Software transactional memoryDistributed Computing, 1997
- Simple, fast, and practical non-blocking and blocking concurrent queue algorithmsPublished by Association for Computing Machinery (ACM) ,1996
- Lock-free linked lists using compare-and-swapPublished by Association for Computing Machinery (ACM) ,1995
- Lock-free garbage collection for multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1992
- “Algorithms for on-the-fly garbage collection” revisitedInformation Processing Letters, 1987
- On-the-fly garbage collection: New algorithms inspired by program proofsPublished by Springer Science and Business Media LLC ,1982
- Concurrent manipulation of binary search treesACM Transactions on Database Systems, 1980
- On-the-fly garbage collectionCommunications of the ACM, 1978
- Multiprocessing compactifying garbage collectionCommunications of the ACM, 1975