Quorum systems constructed from combinatorial designs

Information and Computation

Volumn 169, Issue 2, 2001, Pages 160-173

  Colbourn, Charles J ^a   Dinitz, Jeffrey H ^a   Stinson, Douglas R ^b  

^a University of Vermont ^*  (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

QUORUM SYSTEMS;

COMPUTER SCIENCE;

EID: 0035885987     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3044     Document Type: Article

References (16)

1. Agrawal, D., Eǧecioǧlu, O., and El Abbadi, A. (1997), Billiard quorums on the grid, Inform. Process. Lett. 64, 9-16.
2. Cheung, S. Y., Ammar, M. H., and Ahamad, M. (1990), The grid protocol: A high performance scheme for maintaining replicated data, in "6th IEEE Conference on Data Engineering," pp. 438-445.
3. Colbourn, C. J., and Dinitz, J. H. (1996), "The CRC Handbook of Combinatorial Designs," CRC Press, Boca Raton, FL.
4. Colbourn, C. J., and Rosa, A. (1999), "Triple Systems," Oxford Univ. Press, Oxford.
5. Grannell, M. J., Griggs, T. S., and Mendelsohn, E., (1995), A small basis for four-line configurations in Steiner triple systems, J. Combin. Designs 3, 51-59.
6. Holzman, R., Marcus, Y., and Peleg, D. (1997), Load balancing in quorum systems, SIAM J. Discrete Math. 10, 223-245.
7. Ling, A. C. H., Colbourn, C. J., Grannell, M. J., and Griggs, T. S., Construction techniques for anti-Pasch Steiner triple systems, J. London Math. Soc. (2) 61 (2000), 641-657.
8. Lovász, L. (1973), Coverings and colorings of hypergraphs, in "4th Southeastern Conference on Combinatorics, Graph Theory and Computing," pp. 3-12.
9. Lovász, L. (1975), On the minimax theorems of combinatorics, Math. Lapok 26, 209-264 [In Hungarian].
10. Luk, W.-S., and Wong, T.-T. (1997), Two new quorum based algorithms for distributed mutual exclusion, in "17th International Conference on Distributed Computing Systems," pp. 100-106.
11. Maekawa, M. (1985), A √N algorithm for mutual exclusion in decentralized systems, ACM Trans. Comput. System 3, 145-159.
12. Mills, W. H., and Mullin, R. C. (1992), Coverings and packings, in "Contemporary Design Theory: A Collection of Surveys" (J. H. Dinitz and D. R. Stinson, Eds.), pp. 371-399, Wiley, New York.
13. Naor, M., and Wool, A. (1994), The load, capacity and availability of quorum systems, in "35th IEEE Symposium on the Foundations of Computer Science," pp. 214-225.
14. Peleg, D., and Wool, A. (1995), The availability of quorum systems, Inform. and Comput. 123, 210-223.
15. Stinson, D. R., and Wei, Y. J. (1992), Some results on quadrilaterals in Steiner triple systems, Discrete Math. 105, 220-245.
16. Valiant, L. G. (1979), The complexity of enumeration and reliability problems, SIAM J. Comput. 8, 410-421.