An optimistic approach to lock-free FIFO queues
- 30 November 2007
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 20 (5) , 323-341
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Obstruction-free synchronization: double-ended queues as an example2004
- On the Uncontended Complexity of Consensus2003
- Queue locks on cache coherent multiprocessors2002
- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures2002
- Dynamic-sized lock-free data structures2002
- \bf DCAS-Based Concurrent DequesTheory of Computing Systems, 2002
- Atomic snapshots of shared memoryJournal of the ACM, 1993
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983