Designing algorithms for dependent process failures

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

Volumn 2584, Issue , 2003, Pages 24-28

  Junqueira, Flavio ^a   Marzullo, Keith ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745132631     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37795-6_5     Document Type: Article

References (8)

1. T. Chandra, V. Hadzilacos, and S. Toueg. The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4):685-722, July 1996.
2. A. Doudou and A. Schiper. Muteness Detectors for Consensus with Byzantine Processes. In Proceedings of the 17th ACM Symposium on Principle of Distributed Computing, page 315, Puerto Vallarta, Mexico, July 1998.
3. M. Hirt and U. Maurer. Complete Characterization of Adversaries Tolerable in Secure Multy-Party Computation. In ACM Symposium on Principles of Distributed Computing, pages 25-34, Santa Barbara, California, 1997.
4. F. Junqueira and K. Marzullo. Consensus for Dependent Process Failures. Technical report, UCSD, La Jolla, CA, September 2002. http://www.cs.ucsd.edu/users/flavio/Docs/Gen.ps.
5. I. Keidar and S. Rajsbaum. On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial. Technical Report MIT-LCS-TR-821, MIT, May 2001.
6. D. Malkhi and M. Reiter. Byzantine Quorum Systems. In 29th ACM Symposium on Theory of Computing, pages 569-578, May 1997.
7. Y. Ren and J. B. Dugan. Optimal Design of Reliable Systems Using Static and Dynamic Fault Trees. IEEE Transactions on Reliability, 47(3):234-244, December 1998.
8. P. Thambidurai and Y.-K. Park. Interactive Consistency with Multiple Failure Modes. In IEEE 7th Symposium on Reliable Distributed Systems, pages 93-100, Columbus, Ohio, October 1988.