Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
暂无分享,去创建一个
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 about the system.
[1] Daniel Lehmann,et al. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.
[2] Danny Dolev,et al. Polynomial algorithms for multiple processor agreement , 1982, STOC '82.
[3] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[4] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.