Synchronous consensus for dependent process failures

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2003, Pages 274-283

  Junqueira, Flavio P ^a   Marzullo, Keith ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Consensus; Correlated failures; Distributed algorithms; Fault tolerance; Synchronous systems

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; DISTRIBUTED COMPUTER SYSTEMS; EMBEDDED SYSTEMS; SOFTWARE ENGINEERING;

CORRELATED FAILURES; DEPENDENT PROCESS FAILURES; DISTRIBUTED ALGORITHMS; SYNCHRONOUS CONCENSUS; SYNCHRONOUS SYSTEMS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0038305315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, 1998.
2. T. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225-267, March 1996.
3. B. Charron-Bost and A. Schiper. Uniform Consensus is Harder Than Consensus. Technical Report DSC/2000/028, École Polytechnique Fédérale de Lausanne, Switzerland, May 2000.
4. D. Dolev, R. Reischuk, and H. R. Strong. Early Stopping in Byzantine Agreement. Journal of the ACM, 37(4):720-741, October 1990.
5. A. Doudou and A. Schiper. Muteness Detectors for Consensus with Byzantine Processes. In 17th ACM Symposium on Principle of Distributed Computing, page 315, Puerto Vallarta, Mexico, July 1998. (Brief Announcement)
6. R. Guerraoui and A. Schiper. Consensus Service: A Modular Approach for Building Fault-tolerant Agreement Protocols in Distributed Systems. In 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pages 168-177, Sendai, Japan, June 1996.
7. M. Hirt and U. Maurer. Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation. In ACM Symposium on Principles of Distributed Computing, pages 25-34, Santa Barbara, California, 1997.
8. F. Junqueira and K. Marzullo. Consensus for Dependent Process Failures. Technical Report CS2003-0737, UCSD, La Jolla, CA, September 2002.
9. F. Junqueira and K. Marzullo. Lower Bound on the Number of Rounds for Synchronous Consensus with Dependent Process Failures. Technical Report CS2003-0734, UCSD, La Jolla, CA, September 2002.
10. F. Junqueira, K. Marzullo, and G. Voelker. Coping with Dependent Process Failures. Technical Report CS2002-0723, UCSD, La Jolla, CA, December 2001.
11. 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.
12. L. Lamport and M. Fischer. Byzantine Generals and Transaction Commit Protocols. Available at URLhttp://research.microsoft.com/users/lamport/pubs/trans.pdf April 1982.
13. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3): 382-401, July 1982.
14. D. Malkhi and M. Reiter. Byzantine Quorum Systems. In 29th ACM Symposium on Theory of Computing, pages 569-578, may 1997.
15. D. Malkhi and M. Reiter. Unreliable Intrusion Detection in Distributed Computations. In 10th Computer Security Foundations Workshop (CSFW97), pages 116-124, Rockport, MA, June 1997.
16. J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine Storage. In 16th International Symposium on Distributed Computing (DISC 2002), Toulouse, France, October 2002.
17. M. Pease, R. Shostak, and L. Lamport. Reaching Agreement in the Presence of Faults. Journal of the ACM, 27(2):228-234, April 1980.
18. 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.
19. R. Rodrigues, B. Liskov, and M. Castro. BASE: Using Abstraction to Improve Fault Tolerance. In 18th ACM Symposium on Operating Systems Principles (SOSP'01), volume 35, pages 15-28, Chateau Lake Louise, Banff, Alberta, Canada, October 2001.
20. D. Skeen. Determining the Last Process to Fail. ACM Transactions on Computer Systems, 3(1): 15-30, February 1985.
21. P. Thambidura 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.
22. J. von Neumann. Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components. In Automata Studies, pages 43-98. Princeton University Press, 1956.
23. J. H. Wensley, M. W. Green, K. N. Levitt, and R. E. Shostak, SIFT: Design and Analysis of a Fault-Tolerant Computer for Aircraft Control. In 2nd IEEE International Conference on Software Engineering, pages 458-469, 1976.