Efficient asynchronous consensus with the value-oblivious adversary scheduler
Authors:
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 622-633
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Clock construction in fully asynchronous parallel systems and PRAM simulationTheoretical Computer Science, 1994
- Randomized consensus in expected O(n log/sup 2/ n) operations per processor1992
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990
- Time-and space-efficient randomized consensus1990
- Bounded Polynomial Randomized Consensus1989
- On achieving consensus using a shared memory1988
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- N-Process mutual exclusion with bounded waiting by 4 · Log2 N-valued shared variableJournal of Computer and System Sciences, 1982