On the Uncontended Complexity of Consensus
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 45-59
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Space- and Time-adaptive Nonblocking AlgorithmsElectronic Notes in Theoretical Computer Science, 2003
- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures2002
- A Practical Multi-word Compare-and-Swap Operation2002
- Non-blocking steal-half work queues2002
- A Pragmatic Implementation of Non-blocking Linked-lists2001
- On the space complexity of randomized synchronizationJournal of the ACM, 1998
- Thread scheduling for multiprogrammed multiprocessors1998
- Long-lived renaming made fast1995
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985