Skip to main content
SpringerLink
Log in

Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1989)

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

Included in the following conference series:

Abstract

In this paper we present a distributed algorithm for mutual exclusion. The algorithm maintains a dynamic forest structure in which the paths between nodes are compressed as a result of requesting the Critical Section. We develop a formal model of the algorithm's execution, which enables us to prove its correctnes. The formal model is also used to show that an execution history of the algorithm when concurrent requests are made (the ususal case) is equivalent to a history in which the requests are made serially. Based on this fact we are able to prove a logarithmic upper bound on the average number of messages needed per critical section grant.

This work was supported in part by NSF grants CCR-8806358 and CCR-8619886.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Raynal, Algorithms for Mutual Exclusion. Series in Computer Systems, Cambridge, Massachussets: MIT Press, 1st ed., 1986. Translated by D. Beeson.

    Google Scholar 

  2. B. A. Sanders, “The information structure of distributed mutual exclusion algorithms,” ACM Trans. Computer Systems, vol. 5, pp. 284–299, August 1987.

    Google Scholar 

  3. L. Lamport, “Time, clocks and the ordering of events in a distributed system,” Communications ACM, vol. 21, pp. 558–565, July 1978.

    Google Scholar 

  4. G. Ricart and A. K. Agrawala, “An optimal algorithm for mutual exclusion in computer networks,” Communications ACM, vol. 24, pp. 9–17, January 1981.

    Google Scholar 

  5. M. Maekawa, “A √N algorithm for mutual exclusion in decentralized systems,” ACM Trans. Computer Systems, vol. 3, pp. 145–159, May 1985.

    Google Scholar 

  6. M. Singhal, “A dynamic information-structure mutual exclusion algorithm for distributed systems,” Tech. Rep., Department of Computer and Information Science. The Ohio State University, 1988.

    Google Scholar 

  7. I. Suzuki and T. Kasami, “A distributed mutual exclusion algorithm,” ACM Trans. Computer Systems, vol. 3, pp. 344–349, November 1985.

    Google Scholar 

  8. O. Carvalho and G. Roucairol, “On mutual exclusion in computer networks,” Communications ACM, vol. 26, pp. 146–147, February 1983.

    Google Scholar 

  9. D. Agrawal and A. El Abbadi, “An efficient solution to the distributed mutual exclusion problem,” Tech. Rep., Department of Computer Science. University of California at Santa Barbara, 1988.

    Google Scholar 

  10. K. Raymond, “A tree-based algorithm for distributed mutual exclusion,” ACM Trans. Computer Systems, vol. 7, pp. 61–77, February 1989.

    Google Scholar 

  11. J. L. van de Snepscheut, “Fair mutual exclusion on a graph of processes,” Distributed Computing, vol. 2, pp. 113–115, 1987.

    Google Scholar 

  12. S. J. Mullender and P. M. Vitány, “Distributed match-making,” Algorithmica, no. 3, pp. 367–391, 1988.

    Google Scholar 

  13. M. Powell and B. Miller, “Process migration in DEMOS/MP,” in Proceedings Of the 9th Symposium on Operating System Principles. (Breton Woods, N.H.), pp. 110–119, ACM, October 10–13 1983.

    Google Scholar 

  14. R. Fowler, “Decentralized object finding using forwarding addresses,” PhD Thesis 85-12-1, University of Washington, December 1985.

    Google Scholar 

  15. N. A. Lynch and M. R. Tuttle, “Hierarchical correctness proofs for distributed algorithms,” in Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pp. 137–151, ACM SIGACT and ACM SIGOPS, ACM Press, August 1987.

    Google Scholar 

  16. J. M. Bernabéu-Aubán and M. Ahamad, “Modeling an efficient mutual exclussion algorithm for distributed systems,” Tech. Rep. GIT-ICS-89/18, School of Information and Computer Science, Georgia Institute of Technology, ATLANTA, GA 30332, April 1989.

    Google Scholar 

  17. A. C. Yao, “On the expected performance of path compression algorithms,” SIAM Journal on Computing, vol. 14, pp. 129–133, February 1985.

    Article  Google Scholar 

  18. M. Paterson, “,” 1972. MIT class notes for course 6.851J, by A.R. Meyer and M.J. Fischer, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia Apartado 22012, 46020, Valencia, Spain

    José M. Bernabéu-Aubán

  2. School of Information and Computer Science, Georgia Institute of Technology, 30332-0280, Atlanta, GA, USA

    Mustaque Ahamad

Authors
  1. José M. Bernabéu-Aubán
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mustaque Ahamad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Claude Bermond Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernabéu-Aubán, J.M., Ahamad, M. (1989). Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm. In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-51687-5_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51687-3

  • Online ISBN: 978-3-540-46750-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation