The load, capacity, and availability of quorum systems

SIAM Journal on Computing

Volumn 27, Issue 2, 1998, Pages 423-447

  Naor, Moni ^a   Wool, Avishai ^a,b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Distributed computing; Fault tolerance; Linear programming; Load; Percolation theory; Quorum systems

Indexed keywords

AVAILABILITY; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; LINEAR PROGRAMMING; LOADING; PERCOLATION (SOLID STATE); SOLVENTS;

DISTRIBUTED SYSTEMS; FAILURE PROBABILITY; HIGH AVAILABILITY; HIGH PROBABILITY; MUTUAL EXCLUSIONS; NOVEL CONSTRUCTION; PERCOLATION THEORY; QUORUM SYSTEMS;

PROBABILITY;

EID: 0002957803     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795281232     Document Type: Article

References (46)

1. D. AGRAWAL AND A. EL-ABBADI, An efficient and fault-tolerant solution for distributed mutual exclusion, ACM Trans. Comp. Sys., 9 (1991), pp. 1-20.
2. R. AHARONI, P. ERDÖS, AND N. LINIAL, Dual integer linear programs and the relationship between their optima, in Proc. 17th Annual ACM Symp. Theory of Computing (STOC), ACM, New York, 1985, pp. 476-483.
3. M. AIZENMAN, J. T. CHAYES, L. CHAYES, J. FRÖHLICH, AND L. RUSSO, On a sharp transition from area law to perimeter law in a system of random surfaces, Comm. Math. Physics, 92 (1983), pp. 19-69.
4. D. BARBARA AND H. GARCIA-MOLINA, The reliability of vote mechanisms, IEEE Trans. Comput., C-36 (1987), pp. 1197-1208.
5. S. Y. CHEUNG, M. H. AMMAR, AND M. AHAMAD, The grid protocol: A high performance scheme for maintaining replicated data, in Proc. 6th IEEE Int. Conf. Data Engineering, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 438-445.
6. N. CONDORCET, Essai sur l'application de l'analyse à la probabilité des decisions rendues à la pluralite des voix, Paris, 1785.
7. S. B. DAVIDSON, H. GARCIA-MOLINA, AND D. SKEEN, Consistency in partitioned networks, ACM Computing Surveys, 17 (1985), pp. 341-370.
8. M. DUBINER AND U. ZWICK, Amplification and percolation, in Proc. 33rd Annual IEEE Symp. Foundations of Comput. Sci. (FOCS), IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 258-267.
9. P. ERDÖS AND L. LOVÁSZ, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, Proc. Colloq. Math. Soc. János Bolyai 10, 1975, North-Holland, Amsterdam, pp. 609-627.
10. C. M. FORTUIN, P. W. KASTELEYN, AND J. GINIBRE, Correlation inequalities on some partially ordered sets, Comm. Math. Physics, 22 (1971), pp. 89-103.
11. G. N. FREDERICKSON, Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. Comput., 16 (1987), pp. 1004-1022.
12. 2. FÜREDI, Matchings and covers in hypergraphs, Graphs Combin., 4 (1988), pp. 115-206.
13. H. GARCIA-MOLINA AND D. BARBARA, How to assign votes in a distributed system, J. ACM, 32 (1985), pp. 841-860.
14. D. K. GIFFORD, Weighted voting for replicated data, in Proc. 7th Annual ACM Symp. Oper. Sys. Principles (SIGOPS), ACM, New York, 1979, pp. 150-159.
15. G. R. GRIMMETT, Percolation, Springer-Verlag, New York, 1989.
16. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
17. R. HASSIN, Maximum flow in (s, t) planar networks, Inform. Process. Lett., 13 (1981), p. 107.
18. M. P. HERLIHY, Replication Methods for Abstract Data Types, Ph.D. thesis MIT/LCS/TR-319, Massachusetts Institute of Technology, Cambridge, MA, 1984.
19. R. HOLZMAN, Y. MARCUS, AND D. PELEG, Load balancing in quorum systems, SIAM J. Discrete Math., 10 (1997), pp. 223-245.
20. A. ITAI AND Y. SHILOACH, Maximum flow in planar networks, SIAM J. Comput., 8 (1979), pp. 135-150.
21. P. JALOTE, S. RANGARAJAN, AND S. K. TRIPATHI, Capacity of voting systems, IEEE Trans. Software Eng., 19 (1993), pp. 698-706.
22. H. KESTEN, The critical probability of bond percolation on the square lattice equals 1/2, Comm. Math. Physics, 71 (1980), pp. 41-59.
23. A. KUMAR, Hierarchical quorum consensus: A new algorithm for managing replicated data, IEEE Trans. Comput., 40 (1991), pp. 996-1004.
24. A. KUMAR AND S. Y. CHEUNG, A high availability √n hierarchical grid algorithm for replicated data, Inform. Process. Lett., 40 (1991), pp. 311-316.
25. A. KUMAR, M. RABINOVICH, AND R. K. SINHA, A performance study of general grid structures for replicated data, in Proc. 13th Int. Conf. Dist. Comp. Sys., IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 178-185.
26. L. LOVÁSZ, Coverings and colorings of hypergraphs, in Proc. 4th Southeastern Conf. Combinatorics, Graph Theory and Computing, 1973, Utilitas Math. Publishing Inc., Winnipeg, pp. 3-12.
27. L. LOVÁSZ, An Algorithmic Theory of Numbers, Graphs and Convexity, SIAM, Philadelphia, 1986.
28. M. MAEKAWA, A √n algorithm for mutual exclusion in decentralized systems, ACM Trans. Comp. Sys., 3 (1985), pp. 145-159.
29. Y. MARCUS AND D. PELEG, Construction Methods for Quorum Systems, Tech. Report CS9233, The Weizmann Institute of Science, Rehovot, Israel, 1992.
30. T. R. MATHIES, Percolation theory and computing with faulty arrays of processors, in Proc. 3rd ACM-SIAM Symp. on Discrete Alg., SIAM, Philadelphia, 1992, pp. 100-103.
31. M. V. MENSHIKOV, Coincidence of critical points in percolation problems, Soviet Math. Dok., 33 (1986), pp. 856-859.
32. S. J. MULLENDER AND P. M. B. VITÁNYI, Distributed match-making, Algorithmica, 3 (1988), pp. 367-391.
33. M. NAOR AND A. WOOL, The load, capacity and availability of quorum systems, in Proc. 35th Annual IEEE Symp. Foundations of Comput. Sci. (FOCS), IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 214-225.
34. M. NAOR AND A. WOOL, Access control and signatures via quorum secret sharing, in Proc. 3rd ACM Conf. Comp. and Comm. Security, New Delhi, India, ACM, New York, 1996, pp. 157-168. Also available as Theory of Cryptography Library record 96-08, http://theory.lcs.mit.edu/̃tcryptol/1996.html.
35. D. PELEG AND A. WOOL, The availability of quorum systems, Inform. and Comput., 123 (1995), pp. 210-223.
36. D. PELEG AND A. WOOL, The availability of crumbling wall quorum systems, Discrete Appl. Math., 74 (1997), pp. 69-83.
37. D. PELEG AND A. WOOL, Crumbling walls: A class of practical and efficient quorum systems, Distrib. Comput., 10 (1997), pp. 87-98.
38. S. RANGARAJAN AND S. K. TRIPATHI, A robust distributed mutual exclusion algorithm, in Proc. 5th Int. Workshop on Dist. Algorithms (WDAG), Lecture Notes in Comput. Sci. 579, Springer-Verlag, New York, 1991, pp. 295-308.
39. M. RAYNAL, Algorithms for Mutual Exclusion, MIT Press, Cambridge, MA, 1986.
40. A. SCHRIJVER, Theory of Linear and Integer Programming, John Wiley, Chichester, 1986.
41. M. SPASOJEVIC AND P. BERMAN, Voting as the optimal static pessimistic scheme for managing replicated data, IEEE Trans. Par. Dist. Sys., 5 (1994), pp. 64-73.
42. R. H. THOMAS, A majority consensus approach to concurrency control for multiple copy databases, ACM Trans. Database Sys., 4 (1979), pp. 180-209.
43. L. G. VALIANT, Short monotone formulae for the majority function, J. Algorithms, 5 (1984), pp. 363-366.
44. C. WU, Replica Control Protocols that Guarantee High Availability and Low Access Cost, Tech. Report 1817, Dept. Computer Science, University of Illinois, Urbana-Champaign, Urbana, Illinois, 1993.
45. C. WU AND G. G. BELFORD, The triangular lattice protocol: A highly fault tolerant protocol for replicated data, in Proc. 11th Annual IEEE Symp. on Reliable Dist. Sys., 1992, pp. 66-73.
46. T. W. YAN AND H. GARCIA-MOLINA, Distributed selective dissemination of information, in Proc. 3rd Int. Conf. Par. Dist. Info. Sys., IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 89-98.