Zyzzyva: Speculative byzantine fault tolerance

Operating Systems Review (ACM)

Volumn , Issue , 2007, Pages 45-58

  Kotla, Ramakrishna ^a   Alvisi, Lorenzo ^a   Dahlin, Mike ^a   Clement, Allen ^a   Wong, Edmund ^a  

^a University of Texas at Austin   (United States)

Author keywords

Byzantine fault tolerance; Output commit; Replication; Speculative execution

Indexed keywords

BYZANTINE FAULT TOLERANCE; OUTPUT COMMIT; REPLICATION; SPECULATIVE EXECUTION; BYZANTINE FAULT; STATE MACHINE REPLICATION; THREE-PHASE COMMIT PROTOCOLS; TOTAL ORDER; TOTAL ORDERING;

NETWORK PROTOCOLS; USER INTERFACES; COMPUTER OPERATING SYSTEMS; COST REDUCTION; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; MACHINE DESIGN;

FAULT TOLERANCE; QUALITY ASSURANCE;

EID: 41149091269     PISSN: 01635980     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1294261.1294267     Document Type: Article

References (41)

1. OpenSSL. http://www.openssl.org/.
2. US secret service report on insider attacks. http://www.sei.cmu.edu/ about/press/insider-2005.html.
3. M. Abd-El-Malek, G. Ganger, G. Goodson, M. Reiter, and J. Wylie. Fault-scalable byzantine fault-tolerant services. In Proc. SOSP, Oct. 2005.
4. A. Avizienis and L. Chen. On the implementation of n-version programming for software fault tolerance during execution. In Proc. IEEE COMPSAC, pages 149-155, Nov. 1977.
5. W. Bartlett and L. Spainhower. Commercial fault tolerance: A tale of two systems. IEEE TODSC, 1(1):87-96, 2004.
6. L. Bassham and W. Polk. Threat assessment of malicious code and human threats. Technical report, NIST, Computer Security Division, 1994.
7. M. Bellare and D. Micciancio. A new paradigm for collision-free hashing: Incrementally at reduced cost. In EUROCRYPT97, 1997.
8. M. Castro and B. Liskov. Practical byzantine fault tolerance. In Proc. OSDI, February 1999.
9. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM TOCS, Nov. 2002.
10. J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proc. OSDI, Nov. 2006.
11. P. Dutta, R. Guerraoui, and M. Vukolić. Best-case complexity of asynchronous Byzantine consensus. Technical Report EPFL/IC/200499, EPFL, Feb. 2005.
12. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. J. ACM, 1988.
13. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Prog. Lang. Sys., 12(3), 1990.
14. S. King and P. Chen. Backtracking intrusions. In Proc. SOSP, 2003.
15. J. C. Knight and N. G. Leveson. An experimental evaluation of the assumption of independence in multi-version programming. Software Engineering, 12(1):96-109, Jan. 1986.
16. R. Kotla, L. Alvisi, and M. Dahlin. SafeStore: A Durable and Practical Storage System. In USENIX Annual Technical Conference, Monterey, CA, June 2007.
17. R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: Speculative byzantine fault tolerance. University of Texas at Austin, Technical Report: UTCS-TR-07-40, 2007.
18. R. Kotla and M. Dahlin. High-throughput byzantine fault tolerance. In DSN, June 2004.
19. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Comm. ACM, 21(7):558-565, 1978.
20. L. Lamport. The part-time parliament. ACM TOCS, 16(2), 1998.
21. L. Lamport. Lower bounds for asynchronous consensus. In Proc. FUDICO, pages 22-23, June 2003.
22. J. Li and D. Mazières. Beyond one-third faulty replicas in Byzantine fault tolerant services. In NSDI, 2007.
23. B. Liskov, S. Ghemawat, R. Gruber, P. Johnson, and L. Shrira. Replication in the harp file system. In Proc. SOSP, 1991.
24. D. Malkhi and M. Reiter. Byzantine quorum systems. Distributed Computing, 11(4), 1998.
25. J.-P. Martin and L. Alvisi. Fast Byzantine consensus. IEEE TODSC, 3(3):202-215, July 2006.
26. S. Microsystems. NFS: Network file system protocol specification. InternetRFC1094, 1989.
27. S. S. Mukherjee, J. S. Emer, and S. K. Reinhardt. The soft error problem: An architectural perspective. In HPCA, 2005.
28. E. Nightingale, K. Veeraraghavan, P. Chen, and J. Flinn. Rethink the sync. In Proc. OSDI, 2006.
29. E. B. Nightingale, P. Chen, and J. Flinn. Speculative execution in a distributed file system. In Proc. SOSP, Oct. 2005.
30. D. Openheimer, A. Ganapathi, and D. Patterson. Why do internet systems fail, and what can be done about it. In Proc. USITS, Seattle.WA, March 2003.
31. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2), April 1980.
32. V. Prabhakaran, L. Bairavasundaram, N. Agrawal, H. G. A. Arpaci-Dusseau, and R. Arpaci-Dusseau. IRON file systems. In Proc. SOSP, 2005.
33. R. Rodrigues, M. Castro, and B. Liskov. BASE : Using abstraction to improve fault tolerance. In Proc. SOSP, October 2001.
34. D. S. Santry, M. J. Feeley, N. C. Hutchinson, A. C. Veitch, R. W. Carton, and J. Ofir. Deciding when to forget in the Elephant file system. In Proc. OSDI, December 1999.
35. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Computing Surveys, 22(4), 1990.
36. P. Shivakumar, M. Kistler, S. W. Keckler, D. Burger, and L. Alvisi. Modeling the effect of technology trends on the soft error rate of combinational logic. In Proc. DSN, 2002.
37. A. Singh, P. Maniatis, P. Druschel, and T. Roscoe. Conflict-free quorum-based bft protocols. Technical Report 2007-1, Max Planck Institute for Software Systems, August 2007.
38. M. Wiesmann, F. Pedone, A. Schiper, B. Kemme, and G. Alonso. Understanding replication in databases and distributed systems. In Proc. ICDCS, 2000.
39. J. Yang, C. Sar, and D. Engler. Explode: A lightweight, general system for finding serious storage system errors. In Proc. OSDI, 2006.
40. J. Yang, P. Twohey, D. Engler, and M. Musuvathi. Using Model Checking to Find Serious File System Errors. In Proc. OSDI, 2004.
41. J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for byzantine fault tolerant services. In Proc. SOSP, October 2003.