Quorum-based algorithms for group mutual exclusion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2180, Issue , 2001, Pages 16-32

  Joung, Yuh Jzer ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

GROUP MUTUAL EXCLUSION; PROBLEM DEFINITION; QUORUM SYSTEMS; QUORUM-BASED ALGORITHMS; S-ALGORITHMS; STRUCTURE-BASED;

ARTIFICIAL INTELLIGENCE;

EID: 84957011904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_2     Document Type: Conference Paper

References (33)

1. D. Agrawal, Ö. Eğecioğlu, and A. El Abbadi. Billard quorums on the grid. IPL, 64(1):9–16, 14 October 1997.
2. D. Agrawal and A. El Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM TOCS, 9(1):1–20, February 1991.
3. M. Ahamad and M. H. Ammar. Multidimensional voting. ACM TOCS, 9(4):399–431, November 1991.
4. K. Alagarsamy and K. Vidyasankar. Elegant solutions for group mutual exclusion problem. Technical report, Dept. Of Computer Science, Memorial University of Newfoundland, Canada, 1999.
5. R. A. Bazzi. Planar quorums. TCS, 243(1–2):243–268, July 2000.
6. Y.-I. Chang. A correct O(√N) distributed mutual exclusion algorithm. In Proc. 5th Int’l. Conf. On Parallel and Distributed Computing and Systems, pages 56–61, 1992.
7. Y.-I. Chang. Notes on Maekawa’s O(√N) distributed mutual exclusion algorithm. In Proc. SPDP’93, pages 352–359, 1994.
8. S. Y. Cheung, M. H. Ammar, and M. Ahamad. The grid protocol: A high performance scheme for maintaining replicated data. IEEE TKDE, 4(6):582–59, December 1992.
9. M. J. Fischer, N. A. Lynch, J. E. Burns, and A. Borodin. Resource allocation with immunity to limited process failure (preliminary report). In Proc. 20th FOCS, pages 234–254, 1979.
10. W. C. Ada Fu. Enhancing concurrency and availability for database systems. PhD thesis, Simon Fraser University, Burnaby, British Columbia, Canada, 1990.
11. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. JACM, 32(4):841–860, October 1985.
12. David K. Gifford. Weighted voting for replicated data. In Proc. 7th ACM SOSP, pages 150–162, 1979.
13. V. Hadzilacos. A note on group mutual exclusion. In Proc. 20th PODC, 2001.
14. J. W. Havender. Avoiding deadlock in multiasking systems. IBM Systems Journal, 7(2):74–84, 1968.
15. C. A. R. Hoare. Communicating sequential processes. CACM, 21(8):666–677, August 1978.
16. Y.-J. Joung. Asynchronous group mutual exclusion (extended abstract). In Proc. 17th PODC, pages 51–60, 1998. Full paper in Distributed Computing, 13(4):189-206, 2000.
17. Y.-J. Joung. The congenial talking philosophers problem in computer networks (extended abstract). In Proc, 13th DISC, LNCS 1693, pages 195–209, 1999.
18. Y.-J. Joung. On generalized quorum systems. Technical report, Department of Information Management, National Taiwan University, Taipei, Taiwan, 2000.
19. H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae. Availability of k-coterie. IEEE Trans. On Computers, 42(5):553–558, May 1993.
20. P. Keane and M. Moir. A simple local-spin group mutual exclusion algorithm. In Proc. 18th PODC, pages 23–32, 1999.
21. A. Kumar. Hierarchical quorum consensus: A new algorithm for managing replicated data. IEEE Trans. On Computers, 40(9):996–1004, September 1991.
22. A. Kumar and S. Y. Cheung. A high availability √N hierarchical grid algorithm for replicated data. IPL, 40(6):311–316, 30 December 1991.
23. Y.-C. Kuo and S.-T. Huang. A simple scheme to construct k-coteries with O(√N) uniform quorum sizes. IPL, 59(1):31–36, 8 July 1996.
24. Y.-C. Kuo and S.-T. Huang. A geometric approach for constructing coteries and k-coteries. IEEE TPDS, 8(4):402–411, April 1997.
25. L. Lamport. Time, clocks and the ordering of events in a distributed system. CACM, 21(7):558–565, July 1978.
26. M. Maekawa. A √N algorithm for mutual exclusion in decentralized systems. ACM TOCS, 3(2):145–159, May 1985.
27. Y. Marcus and D. Peleg. Construction methods for quorum systems. Technical Report CS92-33, The Weizmann Institute of Science, Rehovot, Israel, 1992.
28. M. L. Neilsen. Properties of nondominated K-coteries. The J. Of Systems and Software, 37(1):91–96, April 1997.
29. D. Peleg and A. Wool. The availability of quorum systems. I&C, 123(2):210–223, December 1995.
30. D. Peleg and A. Wool. Crumbling walls: A class of practical and efficient quorum systems. DC, 10(2):87–97, 1997.
31. G. Ricart and A. K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. CACM, 24(1):9–17, January 1981.
32. B. A. Sanders. The information structure of distributed mutual exclusion algorithms. ACM TOCS, 5(3):284–299, August 1987.
33. M. Singhal. A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems. DC, 4(3):131–138, 1991.