Daniel Golovin
Michael K. Reiter
ABSTRACT
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements of the universe reside on the nodes of a physical network and the participating nodes access the system by contacting every element in some quorum, potentially causing the added network congestion induced by these quorum accesses to play a limiting factor in the performance of the algorithm.In this paper we initiate the study of algorithms to place universe elements on the nodes of a physical network so as to minimize the network congestion that results from quorum accesses, while also ensuring that no physical node is overloaded by access requests from clients. We consider two models, one in which communication routes can be chosen arbitrarily and one in which they are fixed in advance. We show that in either model, the optimal congestion (with respect to the load constraints) cannot be approximated to any factor (unless P=NP). However, we show that at most doubling the load on nodes allows us to achieve a congestion that is close to this optimal value. We also shed some light on the extent to which element migration can reduce congestion in this context.
- Y. Amir and A. Wool. Optimal availability quorum systems: theory and practice. Inf. Proc. Lett., 65(5):223--228, 1998. Google Scholar
Digital Library
- D. Barbara and H. Garcia-Molina. The reliability of voting mechanisms. IEEE Trans. Comput., 36(10):1197--1208, 1987. Google ScholarDigital Library
- M. Bienkowski, M. Korzeniowski, and H. Räcke. A practical algorithm for cosntructing oblivious routing schemes. In Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures, pages 24--33, 2003. Google ScholarDigital Library
- Chandra Chekuri and Sanjeev Khanna. On multi-dimensional packing problems. In SODA '99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 185--194, 1999. Google ScholarDigital Library
- S. Y. Cheung, M. H. Ammar, and M. Ahamad. The grid protocol: A high performance scheme for maintaining replicated data. Knowledge and Data Engineering, 4(6):582--592, 1992. Google ScholarDigital Library
- Y. Dinitz, N. Garg, and M. X. Goemans. On the single-source unsplittable flow problem. Combinatorica, 19(1):17--41, 1999.Google ScholarCross Ref
- Lars Engebretsen and Jonas Holmerin. Towards optimal lower bounds for clique and chromatic number. Theor. Comput. Sci., 299(1-3):537--584, 2003. Google ScholarDigital Library
- A. Waichee Fu. Delay-optimal quorum consensus for distributed systems. IEEE Trans. Parallel and Dist. Sys., 8(1):59--69, 1997. Google ScholarDigital Library
- D. K. Gifford. Weighted voting for replicated data. In Proceedings of the 7th ACM Symposium on Operating Systems Principles (SOSP), pages 150--162, 1979. Google ScholarDigital Library
- S. Gilbert and G. Malewicz. The quorum deployment problem. In 8th International Conference on Principles of Distributed Systems (OPODIS'04), pages 218--228, 2004. Google ScholarDigital Library
- A. Gupta, B. Maggs, F. Oprea, and M.K. Reiter. Quorum placement in networks to minimize delays. In PODC '05: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, pages 87--96, 2005. Google ScholarDigital Library
- C. Harrelson, K. Hildrum, and S. Rao. A polynomial-time tree decomposition to minimize congestion. In Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures, pages 34--43, 2003. Google ScholarDigital Library
- Y. Hassin and D. Peleg. Average probe complexity in quorum systems. In PODC '01: Proceedings of the twentieth annual ACM Symposium on Principles of Distributed Computing, pages 180--189, 2001. Google ScholarDigital Library
- N. Kobayashi, T. Tsuchiya, and T. Kikuno. Minimizing the mean delay of quorum-based mutual exclusion schemes. Journal of Systems and Software, 58(1):1--9, 2001. Google ScholarDigital Library
- A. Kumar, M. Rabinovich, and R. K. Sinha. A performance study of general grid structures for replicated data. In Proceedings 13th International Conference on Distributed Computing Systems, pages 178--185, 1993.Google ScholarCross Ref
- L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133--169, 1998. Google ScholarDigital Library
- T. Leighton, F. Makedon, and I. G. Tollis. A 2n-2 step algorithm for routing in an nxn array with constant size queues. In SPAA '89: Proceedings of the first annual ACM Symposium on Parallel Algorithms and Architectures, pages 328--335, 1989. Google ScholarDigital Library
- M. Maekawa. A √n algorithm for mutual exclusion in decentralized systems. ACM Trans. on Computer Systems, 3:145--159, 1985. Google ScholarDigital Library
- B. M. Maggs, F. Meyer auf~der Heide, B. Vocking, and M. Westermann. Exploiting locality for data management in systems of limited bandwidth. In IEEE Symposium on Foundations of Computer Science, pages 284--293, 1997. Google ScholarDigital Library
- D. Malkhi, M. K. Reiter, and A. Wool. The load and availability of Byzantine quorum systems. SIAM J. Comput., 29(6):1889--1906 (electronic), 2000. Google ScholarDigital Library
- D. Malkhi, M. K. Reiter, A. Wool, and R. N. Wright. Probabilistic quorum systems. Inf. Com., 170(2):184--206, 2001. Google ScholarDigital Library
- M. Naor and A. Wool. The load, capacity, and availability of quorum systems. SIAM J. Comput., 27(2):423--447, 1998. Google ScholarDigital Library
- D. Peleg and A. Wool. The availability of quorum systems. Inf. Comp., 123(2):210--223, 1995. Google ScholarDigital Library
- D. Peleg and A. Wool. Crumbling walls: A class of practical and efficient quorum systems. Dist. Comp., 10(2):87--97, 1997.Google ScholarCross Ref
- H. Räcke. Minimizing congestion in general networks. In IEEE Symposium on Foundations of Computer Science, pages 43--52, 2002. Google ScholarDigital Library
- P. Raghavan and C. D. Thompson. Provably good routing in graphs: regular arrays. In STOC '85: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 79--87, 1985. Google ScholarDigital Library
- Aravind Srinivasan. Distributions on level-sets with applications to approximation algorithms. In FOCS '01: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, page 588, 2001. Google ScholarDigital Library
- R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, 1979. Google ScholarDigital Library
- T. Tsuchiya, M. Yamaguchi, and T. Kikuno. Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes. IEEE Transactions on Parallel and Distributed Systems, 10(4):337--345, 1999. Google ScholarDigital Library
- L. G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11(2):350--361, May 1982.Google ScholarDigital Library
- L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In STOC '81: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pages 263--277, 1981. Google ScholarDigital Library
- M. Westermann. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, 2001.Google Scholar
Index Terms
- Quorum placement in networks: minimizing network congestion
Recommendations
Quorum placement in networks to minimize access delays
PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computingA quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of nodes. Such algorithms are used for applications such as mutual exclusion, ...
Signed quorum systems
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computingWith n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum systems. However, even this optimal construction requires (n+1)/2 functioning servers ...
The Load and Availability of Byzantine Quorum Systems
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose ...
Comments