Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
- 1 March 2005
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 17 (3) , 191-207
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Randomized protocols for asynchronous consensusDistributed Computing, 2003
- Are wait-free algorithms fast?2002
- Lower bounds for distributed coin-flipping and randomized consensusJournal of the ACM, 1998
- Efficient Execution of Nondeterministic Parallel Programs on Asynchronous SystemsInformation and Computation, 1997
- Efficient asynchronous consensus with the weak adversary scheduler1997
- Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per ProcessorSIAM Journal on Computing, 1996
- Efficient asynchronous consensus with the value-oblivious adversary scheduler1996
- Clock construction in fully asynchronous parallel systems and PRAM simulationTheoretical Computer Science, 1994
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990
- On achieving consensus using a shared memory1988