Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Illustrating the impossibility of crash-tolerant consensus in asynchronous systems
ACM SIGOPS Operating Systems Review
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On conspiracies and hyperfairness in distributed computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.89 |
We present a simple elementary proof for the result of Fischer, Lynch, and Paterson (FLP) [J. ACM 32 (2) (April 1985) 374-382] that the consensus problem cannot be solved deterministically in an asynchronous system where a single process may fail by crashing. Our proof is, in contrast to the original, constructive in its crucial lemma, showing not only that a nonterminating execution does exist but also how it can be constructed. Our proof is based on the new notion of non-uniformity of a configuration. Non-uniformity is different from bivalency, which is the central notion in the original proof as well as in proofs of related results.