Abstract
This paper introduces and studies the question of balancing the load on processors participating in a given quorum system. Our proposed measure for the degree of balancing is the ratio between the load on the most frequently referenced element, and on the least frequently used one.
Supported in part by a Walter and Elise Haas Career Development Award and by a grant from the Basic Research Foundation. Part of the work was done while visiting IBM T.J. Watson Research Center.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berge, C., Hypergraphs, North-Holland, 1989.
Bollobás, B., Combinatorics, Cambridge University Press, 1986.
Erdős, P. 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. Bolyai 10, North-Holland, 1974, pp. 609–627.
Füredi, Z., Maximum degree and fractional matchings in uniform hypergraphs, Combinatorica 1 (1981) 155–162.
Garcia-Molina, H. and D. Barbara, How to assign votes in a distributed system, J. ACM 32 (1985) 841–860.
Hall, M., Combinatorial Theory, John Wiley, 1986.
Herlihy, M.P., Replication methods for abstract data types, Ph.D. thesis, MIT, 1984.
Ibaraki, T., and T. Kameda, Theory of coteries, Tech. Report CSS/LCCR TR90-09, Simon Fraser University, Burnaby, B.C. Canada, 1990.
Lovà sz, L., Coverings and colorings of hypergraphs, In Proc. 4th Southeastern Conf. on Combinatorics, Graph Theory and Computing (Florida Atlantic University), Utilitas Mathematica, Winnipeg, Canada, 1973, 47–56.
Lovász, L., On the minimax theorems of combinatorics, Mat. Lapok 26 (1975) 209–264 (Hungarian).
Y. Marcus and D. Peleg, Construction methods for quorum systems, Tech. Report CS92-33, the Weizmann Institute of Science, 1992.
Y. Marcus, Load balancing in quorum systems, M.Sc. Thesis, the Weizmann Institute of Science, 1992.
Mullender, S.J., and P.M.B. Vità nyi, Distributed match-making, Algorithmica 3 (1988), 367–391.
Naor, M., and A. Wool, The load, capacity and availability of quorum systems, to appear in Proc. FOCS'94.
Ostmann, A., Decisions by players of comparable strength, Z. für Nationalökonomie 45 (1985) 267–284.
Owen, G., Game Theory, Academic Press, 1982.
Peleg, D., and A. Wool, The availability of quorum systems, Technical Report CS93-17, The Weizmann Institute of Science, Rehovot, Israel, 1993.
Raynal, M., Algorithms for mutual exclusion, MIT Press, 1986.
Tuza, Zs., Critical hypergraphs and intersecting set-pair systems, J. Combin. Th. (Ser. B) 39 (1985) 134–145.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holzman, R., Marcus, Y., Peleg, D. (1995). Load balancing in quorum systems. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_49
Download citation
DOI: https://doi.org/10.1007/3-540-60220-8_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60220-0
Online ISBN: 978-3-540-44747-4
eBook Packages: Springer Book Archive