Nonblocking k-compare-single-swap
- 7 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 314-323
- https://doi.org/10.1145/777412.777468
Abstract
No abstract availableKeywords
This 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
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writesPublished by Association for Computing Machinery (ACM) ,2002
- DCAS-based concurrent dequesPublished by Association for Computing Machinery (ACM) ,2000
- Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory MultiprocessorsJournal of Parallel and Distributed Computing, 1998
- Software transactional memoryDistributed Computing, 1997
- Universal operationsPublished by Association for Computing Machinery (ACM) ,1996
- Forward and Backward SimulationsInformation and Computation, 1995
- Atomic snapshots of shared memoryJournal of the ACM, 1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990