Time and message efficient Reliable Broadcasts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 486 LNCS, Issue , 1991, Pages 289-303

  Chandra, Tushar Deepak ^a   Toueg, Sam ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BROADCAST TIME; CRASH FAILURES; OMISSION FAILURES; RELIABLE BROADCAST;

ARTIFICIAL INTELLIGENCE;

EID: 84985974859     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54099-7_20     Document Type: Conference Paper

References (26)

1. [AWH90] Eugene Amdur, Sam Weber, and Vassos Hadzilacos. On the message complexity of binary byzantine agreement under crash failures. 1990. Submitted to Distributed Computing.
2. Gabriel Bracha. Personal communication. 1982.
3. [CASD85] Flaviu Cristian, Houtan Aghili, H. Raymond Strong, and Danny Dolev. Atomic broadcast: From simple message diffusion to Byzantine agreement. In Proceedings of the Fifteenth International Symposium on Fault-Tolerant Computing, pages 200–206, June 1985. A revised version appears as IBM Research Laboratory Technical Report RJ5244 (April 1989).
4. [CM84] J. Chang and N. Maxemchuk. Reliable broadcast protocols. ACM Transactions on Computer Systems, 2(3):251–273, August 1984.
5. [CT90] Tushar Deepak Chandra and Sam Toueg. Time and message efficient reliable broadcasts. Technical Report 90-1094, Department of Computer Science, Cornell University, May 1990.
6. [CW86] Brian A. Coan and Jennifer L. Welch. Transaction commit in a realistic fault model. In Proceedings of the Fifth ACM Symposium on Principles of Distributed Computing, pages 40–51, August 1986.
7. [DR85] Danny Dolev and Rüdiger Reischuk. Bounds on information exchange for Byzantine agreement. Journal of the ACM, 32(1):191–204, January 1985.
8. [DRS86] Danny Dolev, Rüdiger Reischuk, and H. Raymond Strong. Early stopping in Byzantine agreement. Technical Report RJ5406, IBM Research Laboratory, December 1986.
9. [DS83] C. Dwork and D. Skeen. The inherent cost of nonblocking commitment. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, pages 1–11, August 1983.
10. Paul D. Ezhilchelvan. Early stopping algorithms for distributed agreement under fail-stop, omission, and timing fault types. In IEEE 1987 Sixth Symposium on Reliability in Distributed Software and Database Systems, pages 201–212, Computing Laboratory, The university, Newcastle upon Tyne, England, 1987. IEEE computer society press.
11. [GT89] Ajei Gopal and Sam Toueg. Reliable broadcast in synchronous and asynchronous environments (preliminary version). In J.-C. Bermond and M. Raynal, editors, Proceedings of the Third International Workshop on Distributed Algorithms, volume 392 of Lecture Notes on Computer Science, pages 110–123. Springer-Verlag, September 1989.
12. Vassos Hadzilacos. Byzantine agreement under restricted types of failures (not telling the truth is different from telling lies). Technical Report 18-83, Department of Computer Science, Harvard University, 1983. A revised version appears in Hadzilacos’s Ph.D. dissertation [Had84].
13. Vassos Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University, June 1984. Department of Computer Science Technical Report 11-84.
14. Vassos Hadzilacos. On the relationship between the atomic commitment and consensus problems. Workshop on Fault-Tolerant Distributed Computing, March 17–19, 1986, Pacific Grove, CA. (Proceedings to be published in a volume, edited by Brabara Simons, of the Springer-Verlag Series “Lecture Notes on Computer Science”), 1986.
15. [HH90] Vassos Hadzilacos and Joseph Y. Halpern. Message and bit-optimal protocol for byzantine agreement. 1990. To appear.
16. [LSP82] Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, July 1982.
17. Gil Neiger. Techniques for Simplifying the Design of Distributed Systems. PhD thesis, Cornell University, August 1988. Department of Computer Science Technical Report 88-933.
18. [NT90] Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374–419, September 1990.
19. Kenneth J. Perry. Early Stopping Protocols for Fault-Tolerant Distributed Agreement. PhD thesis, Cornell University, February 1985. Department of Computer Science Technical Report 85-662.
20. [PSL80] M. Pease, R. Shostak, and Leslie Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228–234, April 1980.
21. [PT84] Kenneth J. Perry and Sam Toueg An authenticated Byzantine generals algorithm with early stopping. Technical Report 84-620, Department of Computer Science, Cornell University, June 1984.
22. [PT86] Kenneth J. Perry and Sam Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, 12(3):477–482, March 1986.
23. Rüdiger Reischuk. A new solution for the Byzantine general’s problem. Technical Report RJ 3673, IBM Research Laboratory, November 1982.
24. [SGS84] Fred B. Schneider, David Gries, and Richard D. Schlichting. Fault-tolerant broadcasts. Science of Computer Programming, 4(1):1–15, April 1984.
25. Dale Skeen. Crash Recovery in a Distributed Database System. PhD thesis, University of California at Berkeley, Department of EECS, 1982.
26. Samuel Weber. Bounds on the message complexity of Byzantine agreement. Master’s thesis, University of Toronto, October 1989.