Refined quorum systems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 119-128

  Guerraoui, Rachid ^a   Vukolić, Marko ^a  

^a EPFL   (Switzerland)

Author keywords

Arbitrary failures; Complexity; Consensus; Quorums; Shared memory emulations

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; FAILURE ANALYSIS; SET THEORY;

ARBITRARY FAILURES; CONSENSUS ALGORITHM; OPTIMAL RESILIENCE; QUORUM SYSTEMS; SHARED-MEMORY EMULATIONS;

INFORMATION SYSTEMS;

EID: 36849024955     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281120     Document Type: Conference Paper

References (39)

1. M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie. Fault-scalable byzantine fault-tolerant services. In SOSP '05: Proceedings of the twentieth ACM symposium on Operating systems principles, pages 59-74, New York, NY, USA, 2005. ACM Press.
2. I. Abraham, G. V. Chockler, I. Keidar, and D. Malkhi. Byzantine disk paxos: optimal resilience with Byzantine shared memory. Distributed Computing, 18(5):387-408, 2006.
3. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142, 1995.
4. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. UMAC: Fast and secure message authentication. Lecture Notes in Computer Science, 1666:216-233, 1999.
5. M. Castro and B. Liskov. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, New Orleans, USA, February 1999.
6. T. D. Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
7. G. Chockler, R. Guerraoui, and I. Keidar. On the space requirements of robust storage implementations. In Dagstuhl Seminar From Security to Dependability, September 2006.
8. J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proceedings of the Seventh Symposium on Operating Systems Design and Implementations, Seattle, Washington, November 2006.
9. P. Dutta, R. Guerraoui, and M. Vukolić. Best-case complexity of asynchronous Byzantine consensus. Technical Report 200499, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, 2005.
10. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323, April 1988.
11. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.
12. D. K. Gifford. Weighted voting for replicated data. In SOSP "19: Proceedings of the seventh ACM symposium on Operating systems principles, pages 150-162, New York, NY, USA, 1979. ACM Press.
13. D. Golovin, A. Gupta, B. M. Maggs, F. Oprea, and M. K. Reiter. Quorum placement in networks: Minimizing network congestion. In PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pages 16-25, New York, NY, USA, 2006. ACM Press.
14. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the International Conference on Dependable Systems and Networks, p. 135-144, 2004.
15. R. Guerraoui, R. R. Levy, and M. Vukolić. Lucky read/write access to robust atomic storage. In DSN '06: Proceedings of the International Conference on Dependable Systems and Networks (DSN'06), pages 125-136, Washington, DC, USA, 2006. IEEE Computer Society.
16. R. Guerraoui and M. Vukolić. How Fast Can a Very Robust Read Be? In 25th ACM Symposium on Principles of Distributed Computing (PODC'06), 2006.
17. R. Guerraoui and M. Vukolić. Refined quorum systems. Technical Report LPD-REPORT-2007-002, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, February 2007.
18. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1): 124-149, January 1991.
19. M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
20. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In PODC '91: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pages 25-34, New York, NY, USA, 1997. ACM Press.
21. P. Jayanti, T. D. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451-500, 1998.
22. F. P. Junqueira, K. Marzullo. Synchronous Consensus for Dependent Process Failures. In Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS'03), pages 274 - 283, Providence, RI, USA, May 2003.
23. L. Lamport. On interprocess communication. Distributed computing, 1(1):77-101, May 1986.
24. L. Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133-169, 1998.
25. L. Lamport. Lower bounds for asynchronous consensus. In Future Directions in Distributed Computing, Springer Verlag (LNCS), pages 22-23, 2003.
26. L. Lamport. Fast Paxos. Distributed Computing, 19(2):79-103, 2006.
27. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
28. N. A. Lynch and M. R.Tuttle. An introduction to I/O automata. CWI Quarterly, 2(3):219-246, 1989.
29. D. Malkhi and M. Reiter. Byzantine quorum systems. Distributed Computing, 11(4):203-213, 1998.
30. J.-P. Martin and L. Alvisi. Fast Byzantine consensus. IEEE Transactions on Dependable and Secure Computing, 3(3):202-215, 2006.
31. J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. In Proceedings of the 16th International Conference on Distributed Computing, pages 311-325. Springer-Verlag, 2002.
32. M. Naor and A. Wool. The load, capacity and availability of quorum systems. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 214-225, 1994.
33. M. Pease, R. Shostak, and L. Lamport. Reaching agreements in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.
34. H. V. Ramasamy and C. Cachin. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005), Lecture Notes in Computer Science, pages 88-102, December 2005.
35. R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.
36. Y. Saito, S. Frolund, A. Veitch, A. Merchant, and S. Spence. Fab: building distributed enterprise disk arrays from commodity components. SIGOPS Oper. Syst. Rev., 38(5):48-58, 2004.
37. R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst., 4(2):180-209, 1979.
38. J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for Byzantine fault tolerant services. In SOSP '03: Proceedings of the nineteenth ACM symposium on Operating systems principles, pages 253-267, New York, NY, USA, 2003.
39. P. Zieliński. Optimistically terminating consensus. Technical Report UCAM-CL-TR-668, Cambridge University, Cambridge, UK, June 2006.