A framework for the design of dependent-failure algorithms

Concurrency and Computation: Practice and Experience

Volumn 19, Issue 17, 2007, Pages 2255-2269

  Junqueira, Flavio ^a   Marzullo, Keith ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Dependent failures; Distributed algorithms; Fault tolerance; Replication

Indexed keywords

COMPUTER AIDED DESIGN; PARALLEL ALGORITHMS; PROBLEM SOLVING;

DEPENDENT FAILURES; DISTRIBUTED SYSTEMS; REPLICATION;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 35948930673     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1170     Document Type: Article

References (28)

1. Lamport L, Shostak R, Pease M. The byzantine generals problem. ACM Transactions on Programming Languages and Systems 1982; 4(3):382-401.
2. Muhender S (ed.). Distributed Systems (2nd edn), eh. 8. Addison-Wesley: Reading, MA, 1995.
3. Chandra T, Hadzilacos V, Toueg S. The weakest failure detector for solving Consensus. Journal of the ACM 1996; 43(4):685-722.
4. Chandra T, Toueg S. Unreliable failure detectors for reliable distributed systems. Journal of the ACM 1996; 43(2):225-267.
5. Junqueira F, Marzullo K. Coterie availability in sites. Proceedings of the 19th International Symposium on Distributed Computing (DISC), Krakow, Poland, September 2005 (Lecture Notes in Computer Science, vol. 3724). Springer: Berlin, 2005; 2-16.
6. Junqueira F, Marzullo K. Synchronous consensus for dependent process failures. Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS), May 2003. IEEE Computer Society Press: Los Alamitos, CA, 2003; 274-283.
7. Malkhi D, Reiter M. Byzantine quorum systems. Proceedings of the 29th ACM Symposium on Theory of Computing (STOC), May 1997. ACM Press: New York, 1997; 569-578.
8. Garcia-Molina H, Barbara D. How to assign votes in a distributed system. Journal of the ACM 1985; 32(4):841-860.
9. Christian F. Synchronous atomic broadcast for redundant broadcast channels. Journal of Real-Time Systems 1990; 2:195-212.
10. Gray J, Siewiorek D. High-availability computer systems. IEEE Computer 1991; 24(9):39-48.
11. Castro M, Rodrigues R, Liskov B. BASE: Using abstraction to improve fault tolerance. ACM Transactions on Computer Systems 2003; 21(3):236-269.
12. Chen L, Avizienis A. N-version programming: A fault-tolerance approach to reliability of software operation. Proceedings of the International Symposium on Fault-tolerant Computing (FTCS). IEEE Computer Society Press: Los Alamitos, CA, 1978; 3-9.
13. Castro M, Liskov B. Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems 2002; 20(4):398- 461.
14. Schneider FB. Implementing fault-tolerant services using the state-machine approach: A tutorial. ACM Computing Surveys 1990;22(4):299-319.
15. Junqueira F. Coping with dependent failures in distributed systems. PhD Thesis, University of California, San Diego, 2006.
16. Mosleh A. Dependent failure analysis. Reliability Engineering and System Safety 1991; 34(4):243-248.
17. Ren Y, Dugan JB. Optimal design of reliable systems using static and dynamic fault trees. IEEE Transactions on Reliability 1998; 47(3):234-244.
18. Altmann B, Fitzi M, Maurer U. Byzantine agreement secure against general adversaries in the dual failure model. Proceedings of the 13th International Symposium on Distributed Computing (DISC), September 1999 (Lecture Notes in Computer Science, vol. 1693). Springer: Berlin, 1999; 123-139.
19. Hirt M, Maurer U. Complete characterization of adversaries tolerable in secure multi-party computation. Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC), August 1997. ACM Press: New York, 1997; 25-34.
20. Kursawe K, Freiling F. Byzantine fault tolerance on general hybrid adversary structures. Technical Report AIB-2005-09, Aachen University, Germany, January 2005.
21. Martin J-P, Alvisi L. Fast byzantine consensus. Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN), June 2005. IEEE Computer Society Press: Los Alamitos, CA, 2005; 402-411.
22. Guerraoui R, Raynal M. A generic framework for indulgent Consensus. Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS), May 2003. IEEE Computer Society Press: Los Alamitos, CA, 2003; 88-95.
23. Junqueira F, Marzullo K. Consensus for dependent process failures. Technical Report CS2003-0737, UC San Diego, CA, September 2002.
24. Friedman R, Mostefaoui A, Raynal M. Intersecting sets: A basic abstraction for asynchronous agreement problems. Technical Report PI-1598, IRISA, Rennes, France, January 2004.
25. Budhiraja N, Marzullo K, Schneider F, Toueg S. Optimal primary-backup protocols. Proceedings of the 6th International Workshop on Distributed Algorithms (WDAG), November 1992 (Lecture Notes in Computer Science, vol. 647). Springer: Berlin, 1992; 362-378.
26. Junqueira F, Marzullo K. Replication predicates for dependent-failure algorithms. Proceedings of the 11th Euro-Par Conference, Lisbon, Portugal, August 2005 (Lecture Notes in Computer Science, vol. 3648). Springer: Berlin, 2005; 617-632.
27. Kakugawa H, Fujita S, Yamashita M, Ae T. Availability of k-coterie. ACM Transactions on Computers 1993; 42(5):553-558.
28. Lamport L. The part-time parliament. ACM Transactions on Computer Systems 1998; 16(2): 133-169.