Replication predicates for dependent-failure algorithms

Lecture Notes in Computer Science

Volumn 3648, Issue , 2005, Pages 617-632

  Junqueira, Flavio ^a   Marzullo, Keith ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; PROBLEM SOLVING; SUPERVISORY AND EXECUTIVE PROGRAMS;

DEPENDENT-FAILURE ALGORITHMS; LEADER ELECTION PROBLEM; RECEIVE-OMISSION FAILURE; REPLICATION;

COMPUTER SYSTEM RECOVERY;

EID: 27144549663     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549468_69     Document Type: Conference Paper

References (21)

1. B. Altmann, M. Fitzi, and U. Maurer. Byzantine Agreement secure against general adversaries in the dual failure model. In Proceedings of the 13th DISC, volume 1693/1999 of LNCS, pages 123-139. Springer-Verlag, Sep 1999.
2. N. Budhiraja, K. Marzullo, F. Schneider, and S. Toueg. Optimal Primary-Backup protocols. In Proceedings of the 6th WDAG, pages 362-378, Nov 1992.
3. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398-461, Nov 2002.
4. M. Castro, R. Rodrigues, and B. Liskov. BASE: Using abstraction to improve fault tolerance. ACM Transactions on Computer Systems, 21(3):236-269, Aug 2003.
5. T. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving Consensus. Journal of the ACM, 43(4):685-722, Jul 1996.
6. T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, Mar 1996.
7. F. Christian. Synchronous Atomic Broadcast for redundant broadcast channels. Journal of Real-Time Systems, 2:195-212, Sep 1990.
8. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. Journal of the ACM, 32(4):841-860, Oct 1985.
9. J. Gray and D. Siewiorek. High-availability computer systems. IEEE Computer, 24(9):39-48, Sep 1991.
10. R. Guerraoui and M. Raynal. A generic framework for indulgent Consensus. In Proceedings of 23rd IEEE ICDCS, pages 88-95, 2003.
11. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proceedings of the 16th ACM PODC, pages 25-34, Aug 1997.
12. F. Junqueira and K. Marzullo. Consensus for dependent process failures. Technical Report CS2003-0737, UC San Diego, USA, Sep 2002.
13. F. Junqueira and K. Marzullo. Synchronous Consensus for dependent process failures. In Proceedings of the 23rd IEEE ICDCS, pages 274-283, May 2003.
14. F. Junqueira and K. Marzullo. Weak Leader Election in the receive-omission failure model. Technical Report CS2005-0829, UC San Diego, USA, Jun 2005.
15. K. Kursawe and F. Freiling. Byzantine fault tolerance on general hybrid adversary structures. Technical Report AIB-2005-09, Aachen University, Germany, Jan 2005.
16. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, Jul 1982.
17. D. Malkhi and M. Reiter. Byzantine Quorum Systems. In Proceedings of the 29th ACM STOC, pages 569-578, May 1997.
18. J.-P. Martin and L. Alvisi. Fast Byzantine Consensus. In Proceedings of DSN, Jun 2005.
19. S. Mullender, editor. Distributed Systems, chapter 8. Addison-Wesley, 2nd edition, 1995.
20. P. R. Parvèdy and M. Raynal. Optimal early stopping Uniform Consensus in synchronous systems with process omission failures. In Proceedings of the 16th ACM SPAA, pages 302-310, Jun 2004.
21. F. B. Schneider. Implementing fault-tolerant services using the State-Machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, Dec 1990.