Wait-free queues with multiple enqueuers and dequeuers
Authors:
Open Access
- 12 February 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 46 (8) , 223-234
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- An optimistic approach to lock-free FIFO queuesDistributed Computing, 2007
- Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and StacksLecture Notes in Computer Science, 2005
- Hazard pointers: safe memory reclamation for lock-free objectsIEEE Transactions on Parallel and Distributed Systems, 2004
- Adaptive and Efficient Algorithms for Lattice Agreement and RenamingSIAM Journal on Computing, 2001
- Universal constructions for large objectsIEEE Transactions on Parallel and Distributed Systems, 1999
- A methodology for implementing highly concurrent data objectsACM Transactions on Programming Languages and Systems, 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
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974