Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
- 21 July 2002
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- High performance dynamic lock-free hash tables and list-based setsPublished by Association for Computing Machinery (ACM) ,2002
- Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructionsDistributed Computing, 2001
- DCAS-based concurrent dequesPublished by Association for Computing Machinery (ACM) ,2000
- Universal constructions for large objectsIEEE Transactions on Parallel and Distributed Systems, 1999
- Software transactional memoryDistributed Computing, 1997
- A nonblocking algorithm for shared queues using compare-and-swapIEEE Transactions on Computers, 1994
- A methodology for implementing highly concurrent data objectsACM Transactions on Programming Languages and Systems, 1993
- Locking without blockingPublished by Association for Computing Machinery (ACM) ,1992
- Lock-free garbage collection for multiprocessorsPublished by Association for Computing Machinery (ACM) ,1991
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991