Planar quorums

Theoretical Computer Science

Volumn 243, Issue 1-2, 2000, Pages 243-268

  Bazzi, Rida A ^a  

^a Arizona State University   (United States)

Author keywords

Cost of failures; Distributed systems; Fault tolerance; Load; Percolation; Planar graphs; Quorum systems

Indexed keywords

EID: 0004352840     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00208-4     Document Type: Article

References (29)

1. D. Agrawal, A. El-Abbadi, An efficient and fault-tolerant solution for distributed mutual exclusion, ACM Trans. Computer Systems 9 (1) (1991) 1-20.
2. B. Bollobás, Graph Theory, An Introductory Course Graduate Texts in Mathematics, Springer, Berlin, 1979.
3. B. Bollobás, Combinatorics, Cambridge, 1983.
4. Y. Chang, Y. Chang, A fault-tolerant triangular mesh protocol for distributed mutual exclusion, in: Proc. 7th IEEE Symp. on Parallel and Distributed Processing, October 1995, pp. 694-701.
5. N. Condorcet, Essai sur l'application de l'analyse a la probabilité des decision rendues à la pluralité des voix, Paris, 1785.
6. C.H. Cho, J.T. Wang, Triangular grid protocol, an efficient scheme for replica control with uniform access quorums, in: Proc. 2nd Internat. Euro-Par Conf., Lyon, France, August 1996.
7. H. Garcia-Molina, D. Barbara, How to assign votes in a distributed system, J. ACM 32 (4) (1985) 481-860.
8. D.K. Gifford, Weighted voting for replicated data, Proc. 7th ACM Symp. on Operating Systems Principles, December 1979, pp. 150-162.
9. G.R. Grimmett, Percolation, Springer, Berlin, 1989.
10. M.P. Herlihy, Replication methods for abstract data types, Ph.D. Thesis, Massachusetts Institute of Technology, 1984.
11. J.G. Hocking, G.S. Young, Topology, Dover, New York, 1988.
12. T. Ibaraki, T. Kameda, A theory of coteries: mutual exclusion in distributed systems, IEEE Trans. Parallel Distrib. Systems 4 (7) (1993) 749-779.
13. T. Ibaraki, H. Nagamochi, T. Kameda, Optimal coteries for rings and related networks, Distrib. Comput. 8 (1995) 191-201.
14. H. Kesten, Percolation for Mathematicians, Progress in Probability and Statistics, Birkhäuser, Basel, 1982.
15. A. Kumar, Hierarchical quorum consensus, A new algorithm for managing replicated data, IEEE Trans. Computers 40 (9) (1991) 996-1004.
16. A. Kumar, M. Rabinovich, R. Sinha, A performance study of general grid structures for replicated data, in: Proc. Internat. Conf. Distributed Computing Systems, May 1993, pp. 178-185.
17. L. Lovász, Covering and colorings of hypergraphs, in: Proc. 4th Southeastern Conf. on Combinatorics, Graph Theory and Computing, 1973, pp. 3-12.
18. M. Maekawa, A √n algorithm for mutual exclusion in decentralized systems, ACM Trans. Computer Systems 3 (2) (1985) 145-159.
19. C.R.F. Maunder, Algebraic Topology, Van Nostrand, Princeton, NJ, 1970.
20. S.J. Mullender, P.M.B. Vitanyi, Distributed match making, Algorithmica 3 (1992) 367-391.
21. M.L. Neilsen, Quorun structures in distributed systems, Ph.D. Thesis, Department of Computer and Information Sciences, Kansas State University, 1992.
22. M.L. Neilsen, M. Mizuno, Decentralized consensus protocols, in: Proc. 10th Internat. Phoenix Conf. on Computing and Communications, 1991, pp. 257-262.
23. M. Naor, A. Wool, The load, capacity and availability of quorum systems, in: Proc. 35th IEEE Symp. on Foundations of Computer Science, 1994, pp. 214-225.
24. D. Peleg, A. Wool, The availability of quorum systems, Inform, and Comput. 123 (2) (1995) 210-223.
25. D. Peleg, A. Wool, How to be an efficient snoop, or the probe complexity of quorun systems, in: Proc. 15th ACM Symp. Principles of Distributed Computing, 1996, pp. 290-299.
26. D. Peleg, A. Wool, Crumbling walls: a class of practical and efficient quorum systems, Distrib. Comput. 10 (2) (1997) 87-97.
27. D. Skeen, A quorum-based commit protocol, in: Proc. 6th Berkeley workshop on distributed data management and computer networks, 1982, pp. 69-80.
28. R.H. Thomas, A majority consensus approach to concurrency control for multiple copy database, ACM Trans. Database Systems 4 (2) (1979) 180-209.
29. C. Wu, G. Belford, The triangular lattice protocol: a high fault tolerant protocol for replicated data: in: Proc. 11th IEEE Symp. Reliable and Distributed Systems, 1992, pp. 66-73.