A simple model for agreement in distributed systems-Reference-Cited by-同舟云学术

A simple model for agreement in distributed systems

Published: Issue: Volume: Page:42-50
ISSN:
Container-title:Fault-Tolerant Distributed Computing
language:
Short-container-title:

Author:

Dolev Danny

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0042324.pdf

Reference23 articles.

1. H. Aghili, A. Griefer, R. Kistler, R. Strong, “Highly available communication,” Proceedings of the IEEE International Conference on Communication, 1439–1443, Toronto, 1986.

2. B. Coan, “A communication-efficient canonical form for fault-tolerant distributed protocols,” Proc. 5th ACM Symp. on the Principles of Distributed Computing, Calgary, Canada, August, 1986.

3. F. Cristian, H. Aghili, R. Strong, and D. Dolev, “Atomic broadcast: from simple message diffusion to Byzantine agreement,” proceedings, the 15th Int. Conf. on Fault Tolerant Computing, June 1985.

4. D. Dolev, “The Byzantine generals strike again,” Journal of Algorithms 3:1, 1982.

5. D. Dolev, M. Fischer, R. Fowler, N. Lynch, and R. Strong, “An efficient algorithm for Byzantine agreement without authentication,” Information and Control 52:3, 257–274, March 1982.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-Blocking Atomic Commitment in Asynchronous Distributed Systems with Faulty Processes;Algorithms and Architectures for Parallel Processing;2012

2. Synthesis of Fault-Tolerant Distributed Systems;Automated Technology for Verification and Analysis;2009

3. A Probabilistically Correct Election Protocol in Asynchronous Distributed Systems;Lecture Notes in Computer Science;2003

4. About the Relationship between Election Problem and Failure Detector in Asynchronous Distributed Systems;Lecture Notes in Computer Science;2003

5. Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems;Engineering and Deployment of Cooperative Information Systems;2002