The many faces of consensus in distributed systems
- 1 June 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 25 (6), 8-17
- https://doi.org/10.1109/2.153253
Abstract
Known results regarding consensus among processors are surveyed and related to practice. The ideas embodied in the various proofs are explained. The goal is to give practitioners some sense of the system hardware and software guarantees that are required to achieve a given level of reliability and performance. The survey focuses on two categories of failures: fail-stop failures, which occur when processors fail by stopping; and Byzantine failures, which occur when processors fail by acting maliciously.Keywords
This publication has 10 references indexed in Scilit:
- Fast randomized consensus using shared memoryJournal of Algorithms, 1990
- Sharing memory robustly in message-passing systemsPublished by Association for Computing Machinery (ACM) ,1990
- Time-and space-efficient randomized consensusPublished by Association for Computing Machinery (ACM) ,1990
- Impossibility and universality results for wait-free synchronizationPublished by Association for Computing Machinery (ACM) ,1988
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979