Load balancing in quorum systems

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 2, 1997, Pages 223-245

  Holzman, Ron ^a   Marcus, Yosi ^b   Peleg, David ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Coterie; Intersecting hypergraphs; Load balancing; Quorum

Indexed keywords

EID: 0001607359     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193260303     Document Type: Article

References (20)

1. C. BERGE, Hypergraphs, North-Holland, Amsterdam, 1989.
2. B. BOLLOBÁS, Combinatorics, Cambridge University Press, Cambridge, UK, 1986.
3. V. CHVÁTAL, Linear Programming, W.H. Freeman, New York, 1983.
4. H. COHEN, Quorum Systems: Domination, Fault-Tolerance, Balancing, MS Thesis, The Weizmann Institute of Science, Rehovot, Israel, 1993.
5. P. ERDOS AND L. LOVÁSZ, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets, Colloq. Math. Soc. János Bolyai 10, North-Holland, Amsterdam, 1974, pp. 609-627.
6. J. FARKAS, Uber die Theorie der Einfachen Ungleichungen, J. Reine Angew. Math., 124 (1901), pp. 1-27.
7. Z. FÜREDI, Maximum degree and fractional matchings in uniform hypergraphs, Combinatorica, 1 (1981), pp. 155-162.
8. H. GARCIA-MOLINA AND D. BARBARA, How to assign votes in a distributed system, J. Assoc. Comput. Mach., 32 (1985), pp. 841-860.
9. M. HALL, Combinatorial Theory, John Wiley, New York, 1986.
10. M. P. HERLIHY, Replication methods for abstract data types, Ph.D. thesis, MIT, Cambridge, MA, 1984.
11. T. IBARAKI AND T. KAMEDA, Theory of coteries, Tech. Rep. CSS/LCCR TR90-09, Simon Fraser University, Burnaby, BC, Canada, 1990.
12. L. LOVÁSZ, Coverings and colorings of hypergraphs, in Proc. 4th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Florida Atlantic University, Utilitas Mathematica, Winnipeg, Canada, 1973, pp. 47-56.
13. L. LOVÁSZ, On the minimax theorems of combinatorics, Mat. Lapok, 26 (1975), pp. 209-264 (in Hungarian).
14. S. J. MULLENDER AND P.M.B. VITÁNYI, Distributed match-making, Algorithmica, 3 (1988), pp. 367-391.
15. A. OSTMANN, Decisions by players of comparable strength, Z. Nationalökonom., 45 (1985), pp. 267-284.
16. G. OWEN, Game Theory, Academic Press, Boston, MA, 1982.
17. D. PELEG AND A. WOOL, The availability of quorum systems, Tech. Rep. CS93-17, The Weizmann Institute of Science, Rehovot, Israel, 1993.
18. J. PELIKÁN, Properties of balanced incomplete block designs, in Combinatorial Theory and Its Applications, Colloq. Math. Soc. János Bolyai 4, North-Holland, Amsterdam, 1970, pp. 869-889.
19. M. RAYNAL, Algorithms for mutual exclusion, MIT Press, Cambridge, MA, 1986.
20. ZS. TUZA, Critical hypergraphs and intersecting set-pair systems, J. Combin. Theory Ser. B, 39 (1985), pp. 134-145.