Asynchronous Consensus and Broadcast Protocols

Journal of the ACM (JACM)

Volumn 32, Issue 4, 1985, Pages 824-840

  Bracha, Gabriel ^a   Toueg, Sam ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Agreement problem; asynchronous system; Byzantine Generals problem; consensus problem; distributed computing; fault tolerance; impossibility proof; probabilistic algorithms; reliability

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - DISTRIBUTED;

ASYNCHRONOUS PROCESSES; BROADCAST PROTOCOLS; BYZANTINE AGREEMENT; CONSENSUS PROTOCOLS;

COMPUTER NETWORKS;

EID: 0022144724     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/4221.214134     Document Type: Article

References (9)

1. Ben-Or, M. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the 2nd Annual ACM Symposium on Principles ofDistributed Computing (Montreal, Ont., Canada, Aug.). ACM, New York, 1983, pp. 27-30.
2. Dolev, D. Unanimity in an unknown and unreliable environment. In Proceedings of the 22nd Annual Symposium on Foundations of Computer Science (Nashville, Tenn., Oct.). IEEE, New York, 1981, pp. 159-168.
3. Fischer, M. J., Lynch, N. A., and Paterson, M. S. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (Apr. 1985), 374-382.
4. Isaacson, D. L., and Madsen, R. W. Markov Chains Theory and Practice. Wiley, New York. 1976, pp. 89-100.
5. Itai, A. and Rodeh, M. Symmetry breaking in distributive networks. In Proceedings of the 22nd Annual Symposium on Foundation of Computer Science (Nashville, Tenn. Oct.), IEEE, New York, 1981, pp. 150-158.
6. Lamport, L., Shostak, R., and Pease, M. The Byzantine Generals problem. ACM Trans. Prog. Lang. Syst. 4, 3, (July 1982), 382-401.
7. Pease, M., Shostak, R., and Lamport, L. Reaching agreement in the presence of faults. J. ACM 27, 2, (April 1980), 228-234.
8. Rabin, M., and Lehmann, D. On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In Proceedings of the 8th ACM Symposium on the Principles of Programming Languages (Williamsburg, Va. Jan. 26-28). ACM, New York, 1981, pp. 133-138.
9. Schlichting, R. D., and Schneider, F. B. Fail-stop processes: An approach to designing fault-tolerant computing systems. ACM Trans. Comput. Syst. 1, 3 (Aug. 1983), 222-238.