Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (3) , 890-903
- https://doi.org/10.1137/s0097539796312915
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Early consensus in an asynchronous system with a weak failure detectorDistributed Computing, 1997
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocolsInformation Processing Letters, 1990
- Simple constant-time consensus protocols in realistic failure modelsJournal of the ACM, 1989
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985