Skip to main content
Springer Nature Link
Log in

Distributed Mutual Exclusion Algorithms on a Ring of Clusters

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

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

Included in the following conference series:

Abstract

We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms. Each node on the ring represents a cluster of nodes and implements various distributed mutual exclusion algorithms on behalf of any member in the cluster it represents. We show the implementation of Ricart-Agrawala and a Token-based algorithm on this architecture. The message complexities for both algorithms are reduced substantially with this architecture as well as obtaining better response times due to parallel processing in the clusters...

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Chang, Y.I.: A Simulation Study on Distributed Mutual Exclusion. Journal of Parallel and Distributed Computing 33(2), 107–121 (1996)

    Article  Google Scholar 

  2. Erciyes, K.: Implementation of A Scalable Ring Protocol for Fault Tolerance in Distributed Real-Time Systems. In: Proc. of Computer Networks Symposium BAS 2001, pp. 188–197 (2001)

    Google Scholar 

  3. Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. CACM 21, 558–565 (1978)

    MATH  Google Scholar 

  4. Maekawa, M.: A sqrt(n) Algorithm for Mutual exclusion in Decentralized Systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)

    Article  Google Scholar 

  5. Raymond, K.: A tree-based Algorithm for Distributed Mutual Exclusion. ACM Trans. Comput. Systems 7(1), 61–77 (1989)

    Article  MathSciNet  Google Scholar 

  6. Ricart, G., Agrawala, A.: An Optimal Algorithm for Mutual Exclusion in Computer Networks. CACM 24(1), 9–17 (1981)

    MathSciNet  Google Scholar 

  7. Shu, W.: An Efficient Distributed Token-based Mutual Exclusion Algorithm with a Central Coordinator. Journal of Parallel and Distributed Processing 62-10, 1602–1613 (2002)

    Google Scholar 

  8. Singhal, M.: A Taxanomy of Distributed Mutual Exclusion. Journal of Parallel and Distributed Computing 18(1), 94–101 (1993)

    Article  MATH  Google Scholar 

  9. Singhal, M.: A Dynamic Information Structure Mutual Exclusion Algorithm for Distributed System. IEEE Trans. Parallel and Distributed Systems 3(1), 94–101 (1993)

    Google Scholar 

  10. Susuki, I., Kasami, T.: A Distributed Mutual Exclusion Algorithm. ACM Trans. Computer Systems 3(4), 344–349 (1985)

    Article  Google Scholar 

  11. Tunali, T., Erciyes, K., Soysert, Z.: A Hierarchical Fault-Tolerant Ring Protocol For A Distributed Real-Time System. Special issue of Parallel and Distributed Computing Practices on Parallel and Distributed Real-Time Systems 2(1), 47–62 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept, California State University San Marcos, 333 S.Twin Oaks Valley Rd, San Marcos, CA, 92096, U.S.A.

    Kayhan Erciyes

Authors
  1. Kayhan Erciyes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  5. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  6. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Erciyes, K. (2004). Distributed Mutual Exclusion Algorithms on a Ring of Clusters. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24767-8_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24767-8_54

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22057-2

  • Online ISBN: 978-3-540-24767-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics