Skip to main content
SpringerLink
Log in

Quorum-Based Algorithms for Group Mutual Exclusion

  • Conference paper
  • First Online:
Distributed Computing (DISC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2180))

Included in the following conference series:

Abstract

We propose a quorum system, which we referred to as the surficial quorum system, for group mutual exclusion. The surficial quorum system is geometrically evident and so is easy to construct. It also has a nice structure based on which a truly distributed algorithm for group mutual exclusion can be obtained, and processes’ loads can be minimized. When used with Maekawa’s algorithm, the surficial quorum system allows up to \( \sqrt {\frac{{2n}} {{m\left( {m - 1} \right)}}} \) processes to access a resource simultaneously, where n is the total number of processes, and m is the total number of groups. We also present two modifications of Maekawa’s algorithm so that the number of processes that can access a resource at a time is not limited to the structure of the underlying quorum system, but to the number that the problem definition allows.

Part of this research was done when the author was visiting Lab for Computer Science, Massachusetts Institute of Technology (1999–2000). Research supported in part by the National Science Council, Taipei, Taiwan, Grants NSC 89-2213-E-002- 110

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Agrawal, Ö. Eğecioğlu, and A. El Abbadi. Billard quorums on the grid. IPL, 64(1):9–16, 14 October 1997.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  3. M. Ahamad and M. H. Ammar. Multidimensional voting. ACM TOCS, 9(4):399–431, November 1991.

    Article  Google Scholar 

  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.

    Google Scholar 

  5. R. A. Bazzi. Planar quorums. TCS, 243(1-2):243–268, July 2000.

    Article  MATH  MathSciNet  Google Scholar 

  6. Y.-I. Chang. A correct \( O\sqrt {\left( N \right)} \) distributed mutual exclusion algorithm. In Proc. 5th Int’l. Conf. on Parallel and Distributed Computing and Systems, pages 56–61, 1992.

    Google Scholar 

  7. Y.-I. Chang. Notes on Maekawa’s \( O\sqrt {\left( N \right)} \) distributed mutual exclusion algorithm. In Proc. SPDP’ 93, pages 352–359, 1994.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  10. W. C. Ada Fu. Enhancing concurrency and availability for database systems. PhD thesis, Simon Fraser University, Burnaby, British Columbia, Canada, 1990.

    Google Scholar 

  11. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. JACM, 32(4):841–860, October 1985.

    Article  MATH  MathSciNet  Google Scholar 

  12. David K. Gifford. Weighted voting for replicated data. In Proc. 7th ACM SOSP, pages 150–162, 1979.

    Google Scholar 

  13. V. Hadzilacos. A note on group mutual exclusion. In Proc. 20th PODC, 2001.

    Google Scholar 

  14. J. W. Havender. Avoiding deadlock in multiasking systems. IBM Systems Journal, 7(2):74–84, 1968.

    Article  Google Scholar 

  15. C. A. R. Hoare. Communicating sequential processes. CACM, 21(8):666–677, August 1978.

    MATH  Google Scholar 

  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.

    Google Scholar 

  17. Y.-J. Joung. The congenial talking philosophers problem in computer networks (extended abstract). In Proc, 13th DISC, LNCS 1693, pages 195–209, 1999.

    Google Scholar 

  18. Y.-J. Joung. On generalized quorum systems. Technical report, Department of Information Management, National Taiwan University, Taipei, Taiwan, 2000.

    Google Scholar 

  19. H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae. Availability of k-coterie. IEEE Trans. on Computers, 42(5):553–558, May 1993.

    Article  Google Scholar 

  20. P. Keane and M. Moir. A simple local-spin group mutual exclusion algorithm. In Proc. 18th PODC, pages 23–32, 1999.

    Google Scholar 

  21. A. Kumar. Hierarchical quorum consensus: A new algorithm for managing replicated data. IEEE Trans. on Computers, 40(9):996–1004, September 1991.

    Article  Google Scholar 

  22. A. Kumar and S. Y. Cheung. A high availability \( \sqrt N \) hierarchical grid algorithm for replicated data. IPL, 40(6):311–316, 30 December 1991.

    Article  MATH  Google Scholar 

  23. Y.-C. Kuo and S.-T. Huang. A simple scheme to construct k-coteries with \( O\sqrt {\left( N \right)} \) uniform quorum sizes. IPL, 59(1):31–36, 8 July 1996.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  25. L. Lamport. Time, clocks and the ordering of events in a distributed system. CACM, 21(7):558–565, July 1978.

    MATH  Google Scholar 

  26. M. Maekawa. A \( \sqrt N \) algorithm for mutual exclusion in decentralized systems. ACM TOCS, 3(2):145–159, May 1985.

    Article  Google Scholar 

  27. Y. Marcus and D. Peleg. Construction methods for quorum systems. Technical Report CS92-33, The Weizmann Institute of Science, Rehovot, Israel, 1992.

    Google Scholar 

  28. M. L. Neilsen. Properties of nondominated K-coteries. The J. of Systems and Software, 37(1):91–96, April 1997.

    Article  MathSciNet  Google Scholar 

  29. D. Peleg and A. Wool. The availability of quorum systems. IℰC, 123(2):210–223, December 1995.

    MATH  MathSciNet  Google Scholar 

  30. D. Peleg and A. Wool. Crumbling walls: A class of practical and efficient quorum systems. DC, 10(2):87–97, 1997.

    Google Scholar 

  31. G. Ricart and A. K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. CACM, 24(1):9–17, January 1981.

    MathSciNet  Google Scholar 

  32. B. A. Sanders. The information structure of distributed mutual exclusion algorithms. ACM TOCS, 5(3):284–299, August 1987.

    Article  Google Scholar 

  33. M. Singhal. A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems. DC, 4(3):131–138, 1991.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, National Taiwan University, Taipei, Taiwan

    Yuh-Jzer Joung

Authors
  1. Yuh-Jzer Joung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas A&M University, College Station, TX, 77843-3112, USA

    Jennifer Welch

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Joung, YJ. (2001). Quorum-Based Algorithms for Group Mutual Exclusion. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45414-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42605-9

  • Online ISBN: 978-3-540-45414-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation