Impossibility of distributed consensus with one faulty process
@article{Fischer1985ImpossibilityOD,
title={Impossibility of distributed consensus with one faulty process},
author={M. Fischer and N. Lynch and M. Paterson},
journal={J. ACM},
year={1985},
volume={32},
pages={374-382}
}The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the “Byzantine Generals” problem.
2,796 Citations
Non-Blocking Atomic Commitment in Asynchronous Distributed Systems with Faulty Processes
- Computer Science
- ICA3PP
- 2012
- 4
On the minimal synchronism needed for distributed consensus
- Computer Science
- 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
- 1983
- 690
- PDF
Agreement Problems in Fault-Tolerant Distributed Systems
- Computer Science
- SOFSEM
- 2001
- 15
- Highly Influenced
The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
- Computer Science
- ICCSA
- 2006
Consensus with Byzantine Failures and Little System Synchrony
- Computer Science
- International Conference on Dependable Systems and Networks (DSN'06)
- 2006
- 44
A weakest failure detector-based asynchronous consensus protocol for f
- Computer Science
- Inf. Process. Lett.
- 2004
- 12
Agreement without knowing everybody: a first step to dynamicity
- Computer Science
- NOTERE
- 2008
- 4
- Highly Influenced
- PDF