A continuum of failure models for distributed computing

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

Volumn 647 LNCS, Issue , 1992, Pages 153-162

  Garay, Juan A ^a,b   Perry, Kenneth J ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHMIC TECHNIQUES; BYZANTINE FAILURES; CONSENSUS PROBLEMS; CRASH FAILURES; FAILURE MODEL; FAULTY PROCESSORS; RELIABLE BROADCAST; TRADITIONAL MODELS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 21144464689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56188-9_11     Document Type: Conference Paper

References (13)

1. R. Bazzi and G. Neiger. Optimally simulating crash failures. In Proceedings of the Fifth International Workshop on Distributed Algorithms. Springer-Verlag, 1991.
2. P. Berman, J.A. Garay, and K.J. Perry. Towards optimal distributed consensus. In Proceedings of the Thirtieth Annual Symposium on Foundations of Computer Science, pages 410-415. IEEE Computer Society Press, 1989.
3. D. Dolev. The byzantine generals strike again. Journal of Algorithms, 3(1):14-30, 1982.
4. D. Dolev, R. Reischuk, and H.R. Strong. Early stopping in byzantine agreement. Journal of the ACM, 37(4):720-741, 1990.
5. V. Hadzilacos. Issues of fault tolerance in concurrent computations. Ph.D. Dissertation, Harvard University, 1984.
6. L. Lamport. The weak byzantine generals problem. Journal of the ACM, 30(3):668-676, 1983.
7. L. Lamport and M. Fischer. Byzantine generals and transaction commit protocols. Technical Report Opus 62, SRI, 1982.
8. L. Lamport, R.E. Shostak, and M. Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
9. G. Neiger and S. Toueg. Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374-419, 1990.
10. M. Pease, R.E. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, 1980.
11. K.J. Perry and S. Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, 12(3):477-482, 1986.
12. K.J. Perry, S. Toueg and T.K. Srikanth. Fast distributed agreement. SIAM Journal of Computing, 16(3):445-457, 1987.
13. T.K. Srikanth and S. Toueg. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing, 2(2):80-94, 1987.