Refined quorum systems

Distributed Computing

Volumn 23, Issue 1, 2010, Pages 1-42

  Guerraoui, Rachid ^a   Vukolić, Marko ^b  

^a EPFL   (Switzerland)

^b IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Atomic storage; Byzantine failures; Complexity; Consensus; Quorums

Indexed keywords

ATOMIC STORAGE; BYZANTINE FAILURES; COMPLEXITY; CONSENSUS; QUORUMS;

ALGORITHMS; ATOMS; OPTIMIZATION;

REFINING;

EID: 77951945886     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-010-0103-7     Document Type: Article

References (52)

1. Abd-El-Malek, M,; Ganger, G.R,; Goodson, G.R,; Reiter, M.K,; Wylie, J.J.: Fault-scalable Byzantine fault-tolerant services. In: Proceedings of the 20th ACM Symposium on Operating Systems Principles, pp. 59-74 (2005)
2. I. Abraham G.V. Chockler I. Keidar D. Malkhi 2006 Byzantine disk paxos: optimal resilience with Byzantine shared memory Distrib. Comput. 18 5 387 408 10.1007/s00446-005-0151-6
3. Aiyer, A.S,; Alvisi, L,; Bazzi, R.A.: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. In: Proceedings of the 21st International Symposium on Distributed Computing, pp. 7-19 (2007)
4. H. Attiya A. Bar-Noy D. Dolev 1995 Sharing memory robustly in message-passing systems J. ACM 42 1 124 142 0886.68018 10.1145/200836.200869
5. Bazzi, R,; Ding, Y.: Non-skipping timestamps for Byzantine data storage systems. In: Proceedings of the 18th International Symposium on Distributed Computing, pp. 405-419 (2004)
6. Black, J,; Halevi, S,; Krawczyk, H,; Krovetz, T,; Rogaway, P.: UMAC: fast and secure message authentication. In: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, pp. 216-233 (1999)
7. M. Castro B. Liskov 2002 Practical Byzantine fault tolerance and proactive recovery ACM Trans. Comput. Syst. 20 4 398 461 10.1145/571637.571640 (Pubitemid 135702591)
8. T.D. Chandra S. Toueg 1996 Unreliable failure detectors for reliable distributed systems J. ACM 43 2 225 267 0885.68021 10.1145/226643.226647 1408322
9. Chockler, G,; Guerraoui, R,; Keidar, I.: Amnesic distributed storage. In: Proceedings of the 21st International Symposium on Distributed Computing, pp. 139-151 (2007)
10. Cowling, J,; Myers, D,; Liskov, B,; Rodrigues, R,; Shrira, L.: HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In: Proceedings of the 7th Symposium on Operating Systems Design and Implementations (2006)
11. Dutta, P,; Guerraoui, R,; Levy, R.R,; Chakraborty, A.: How fast can a distributed atomic read be? In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 236-245 (2004)
12. Dutta, P,; Guerraoui, R,; Vukolić, M.: Best-case complexity of asynchronous Byzantine consensus. Tech. Rep. 200499, Swiss Federal Institute of Technology (EPFL). School of Computer and Communication Sciences, Lausanne, Switzerland (2005)
13. C. Dwork N. Lynch L. Stockmeyer 1988 Consensus in the presence of partial synchrony J. ACM 35 2 288 323 10.1145/42282.42283 935254 (Pubitemid 18606926)
14. M.J. Fischer N.A. Lynch M.S. Paterson 1985 Impossibility of distributed consensus with one faulty process J. ACM 32 2 374 382 0629.68027 10.1145/3149.214121 831865 (Pubitemid 15488351)
15. Gafni, E.: Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 143-152 (1998)
16. Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the 7th ACM Symposium on Operating Systems Principles, pp. 150-162 (1979)
17. Golovin, D,; Gupta, A,; Maggs, B.M,; Oprea, F,; Reiter, M.K.: Quorum placement in networks: Minimizing network congestion. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 16-25 (2006)
18. Goodson, G,; Wylie, J,; Ganger, G,; Reiter, M.: Efficient Byzantine-tolerant erasure-coded storage. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 135-144 (2004)
19. Guerraoui, R.: Indulgent algorithms (preliminary version). In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 289-297 (2000)
20. Guerraoui, R,; Vukolić, M.: How fast can a very robust read be? In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pp. 248-257 (2006)
21. Guerraoui, R,; Vukolić, M.: Refined quorum systems. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 119-128 (2007)
22. Guerraoui, R,; Levy, R.R,; Vukolić, M.: Lucky read/write access to robust atomic storage. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 125-136 (2006)
23. Hendricks, J,; Ganger, G.R,; Reiter, M.K.: Low-overhead Byzantine fault-tolerant storage. In: SOSP '07: Proceedings of Twenty-First ACM SIGOPS Symposium on Operating Systems Principles, ACM, New York, pp. 73-86 (2007)
24. M. Herlihy 1991 Wait-free synchronization ACM Trans. Program. Lang. Syst. 13 1 124 149 10.1145/114005.102808 (Pubitemid 23600427)
25. M. Herlihy J. Wing 1990 Linearizability: a correctness condition for concurrent objects ACM Trans. Program. Lang. Syst. 12 3 463 492 10.1145/78969.78972 (Pubitemid 20721345)
26. Hirt, M,; Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 25-34 (1997)
27. P. Jayanti T.D. Chandra S. Toueg 1998 Fault-tolerant wait-free shared objects J. ACM 45 3 451 500 1065.68503 10.1145/278298.278305 1639342
28. F. Junqueira K. Marzullo 2007 A framework for the design of dependent-failure algorithms: research articles Concurr. Comput. Pract. Exper. 19 17 2255 2269 10.1002/cpe.1170 (Pubitemid 350074089)
29. Junqueira, F.P,; Marzullo, K.: Synchronous consensus for dependent process failures. In: Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems, pp. 274-283 (2003)
30. Keidar, I,; Shraer, A.: Timeliness, failure-detectors, and consensus performance. In: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 169-178 (2006)
31. R. Kotla L. Alvisi M. Dahlin A. Clement E. Wong 2009 Zyzzyva: Speculative byzantine fault tolerance ACM Trans. Comput. Syst. 27 4 1 39
32. L. Lamport 1978 Time, clocks and the ordering of events in a distributed system Commun. ACM 21 7 558 565 0378.68027 10.1145/359545.359563 (Pubitemid 8615486)
33. L. Lamport 1986 On interprocess communication Distrib. Comput. 1 1 77 101 0598.68022 10.1007/BF01786227 1186494
34. L. Lamport 1998 The part-time parliament ACM Trans. Comput. Syst. 16 2 133 169 10.1145/279227.279229
35. Lamport, L.: Lower bounds for asynchronous consensus. In: Future Directions in Distributed Computing, Springer Verlag (LNCS), pp. 22-23 (2003)
36. L. Lamport 2006 Fast paxos Distrib. Comput. 19 2 79 103 10.1007/s00446-006-0005-x 1097250 (Pubitemid 44673722)
37. L. Lamport R. Shostak M. Pease 1982 The Byzantine generals problem ACM Trans. Program. Lang. Syst. 4 3 382 401 0483.68021 10.1145/357172.357176
38. Lampson, B.: The ABCD's of Paxos. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, p. 13 (2001)
39. N.A. Lynch M.R. Tuttle 1989 An introduction to input/output automata CWI Q. 2 3 219 246 0677.68067 1023472
40. D. Malkhi M. Reiter 1998 Byzantine quorum systems Distrib. Comput. 11 4 203 213 10.1007/s004460050050
41. J.P. Martin L. Alvisi 2006 Fast Byzantine consensus IEEE Trans. Dependable Secur. Comput. 3 3 202 215 10.1109/TDSC.2006.35 (Pubitemid 44304208)
42. Martin, J.P,; Alvisi, L,; Dahlin, M.: Minimal Byzantine storage. In: Proceedings of the 16th International Conference on Distributed Computing, pp. 311-325 (2002a)
43. Martin, J.P,; Alvisi, L,; Dahlin M.: Small Byzantine quorum systems. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 374-383 (2002b)
44. M. Naor A. Wool 1998 The load, capacity, and availability of quorum systems SIAM J. Comput. 27 2 423 447 0911.60080 10.1137/S0097539795281232 1616564
45. M. Pease R. Shostak L. Lamport 1980 Reaching agreements in the presence of faults J. ACM 27 2 228 234 0434.68031 10.1145/322186.322188 567043
46. Ramasamy, H.V,; Cachin, C.: Parsimonious asynchronous Byzantine-fault-tolerant atomic broadcast. In: Proceedings of the 9th International Conference on Principles of Distributed Systems, pp. 88-102 (2005)
47. R.L. Rivest A. Shamir L.M. Adleman 1978 A method for obtaining digital signatures and public-key cryptosystems Commun. ACM 21 2 120 126 0368.94005 10.1145/359340.359342 700103 (Pubitemid 8591219)
48. Y. Saito S. Frolund A. Veitch A. Merchant S. Spence 2004 Fab: building distributed enterprise disk arrays from commodity components SIGOPS Oper. Syst. Rev. 38 5 48 58 10.1145/1037949.1024400 (Pubitemid 44892181)
49. Thambidurai, P,; Park, Y.K. : Interactive consistency with multiple failure modes. In: Proceedings of the Seventh Symposium on Reliable Distributed Systems. IEEE Computer Society Press, pp. 93-100 (1988)
50. R.H. Thomas 1979 A majority consensus approach to concurrency control for multiple copy databases ACM Trans. Database Syst. 4 2 180 209 10.1145/320071.320076 (Pubitemid 9472571)
51. Yin, J,; Martin, J.P,; Venkataramani, A,; Alvisi, L,; Dahlin, M.: Separating agreement from execution for Byzantine fault tolerant services. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles, pp. 253-267 (2003)
52. Zielinski, P.: Optimistically terminating consensus: All asynchronous consensus protocols in one framework. In: Proceedings of The Fifth International Symposium on Parallel and Distributed Computing, pp. 24-33 (2006)