Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
@inproceedings{BenOr1983AnotherAO,
title={Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols},
author={M. Ben-Or},
booktitle={PODC '83},
year={1983}
}Recently, Fischer, Lynch and Paterson [3] proved that no completely asynchronous consensus protocol can tolerate even a single unannounced process death. We exhibit here a probabilistic solution for this problem, which guarantees that as long as a majority of the processes continues to operate, a decision will be made (Theorem 1). Our solution is completely asynchronous and is rather strong: As in [4], it is guaranteed to work with probability 1 even against an adversary scheduler who knows all… Expand
Topics from this paper
Paper Mentions
Blog Post
Blog Post
444 Citations
Simple constant-time consensus protocols in realistic failure models (extended abstract)
- Computer Science
- PODC '85
- 1985
- 16
- PDF
On the minimal synchronism needed for distributed consensus
- Computer Science
- 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
- 1983
- 690
- PDF
The best of both worlds: A hybrid approach to solve consensus
- Computer Science
- Proceeding International Conference on Dependable Systems and Networks. DSN 2000
- 2000
- 40
A weakest failure detector-based asynchronous consensus protocol for f
- Computer Science
- Inf. Process. Lett.
- 2004
- 12
A Simple Predicate to Expedite the Termination of a Randomized Consensus Algorithm
- Computer Science
- 2015 IEEE 29th International Conference on Advanced Information Networking and Applications
- 2015
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
- Computer Science
- IEEE Trans. Dependable Secur. Comput.
- 2005
- 41
Randomized multivalued consensus
- Computer Science
- Fourth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing. ISORC 2001
- 2001
- 43