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}
}
  • M. Ben-Or
  • Published in PODC '83 1983
  • Computer Science
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
444 Citations
Randomized protocols for asynchronous consensus
  • J. Aspnes
  • Computer Science
  • Distributed Computing
  • 2003
  • 143
  • PDF
On the minimal synchronism needed for distributed consensus
  • 690
  • PDF
The best of both worlds: A hybrid approach to solve consensus
  • 40
A Simple Predicate to Expedite the Termination of a Randomized Consensus Algorithm
  • M. Raynal
  • Computer Science
  • 2015 IEEE 29th International Conference on Advanced Information Networking and Applications
  • 2015
Randomized Agreement Protocols
  • M. Ben-Or
  • Computer Science
  • Fault-Tolerant Distributed Computing
  • 1986
  • 6
  • PDF
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
  • 41
Randomized multivalued consensus
  • 43
...
1
2
3
4
5
...