Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

作者: Michael Ben-Or

DOI: 10.1145/800221.806707

关键词:

摘要: 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 …

参考文章(4)
Michael J. Fischer, Nancy A. Lynch, Michael S. Paterson, Impossibility of distributed consensus with one faulty process Journal of the ACM. ,vol. 32, pp. 374- 382 ,(1985) , 10.1145/3149.214121
Michael J. Fischer, Nancy A. Lynch, A lower bound for the time to assure interactive consistency Information Processing Letters. ,vol. 14, pp. 183- 186 ,(1981) , 10.1016/0020-0190(82)90033-3
Danny Dolev, H. Raymond Strong, Polynomial algorithms for multiple processor agreement Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. pp. 401- 407 ,(1982) , 10.1145/800070.802215
Daniel Lehmann, Michael O. Rabin, On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem symposium on principles of programming languages. pp. 133- 138 ,(1981) , 10.1145/567532.567547