Skip to main content
SpringerLink
Log in

A distributed deadlock avoidance technique

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

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

Included in the following conference series:

  • 168 Accesses

Abstract

A deadlock avoidance technique, based on a new way of representing directed acyclic graphs, is presented. We use a path matrix representation making it possible to detect cycles efficiently when attempting to insert edges. This representation also gives an obvious splitting of the global resource allocation graph in a distributed system. The low cost of the cycle detection can amortize the cost of the other operations and linear (or even constant) time for one operation can be attained. The number of sent messages can also be amortized depending on the speed of the message traffic. With sufficiently high speed an amortized constant number of sent messages per operation can be attained.

This work was partly supported by the National Swedish Board for Technical Development (STUF) under contract number 85-3127.

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. I. Cidon & J. M. Jaffe & M. Sidi, "Local Distributed Deadlock Detection by Cycle Detection and Clustering", IEEE Trans. on Software Engineering, Vol. 13, No. 1, January 1987, pp. 3–14.

    Google Scholar 

  2. E. G. Coffman & M. J. Elphick & A. Shoshani, "System Deadlock", Computing Surveys, Vol. 3, No. 2, June 1971, pp. 67–78.

    Article  Google Scholar 

  3. V. D. Gligor & S. H. Shattuck, "On Deadlock Detection in Distributed Systems", IEEE Trans. on Software Engineering, Vol.6, No. 5, September 1980, pp. 435–440.

    Google Scholar 

  4. A. N. Haberman, "Prevention of System Deadlocks", Communications of the ACM, Vol.12, No. 7, July 1969, pp. 373–385.

    Article  Google Scholar 

  5. D. A. Menasce & R. R. Muntz, "Locking and Deadlock Detection in Distributed Data Bases", IEEE Trans. on Software Engineering, Vol. 5, No. 3, May 1979, pp. 195–202.

    Google Scholar 

  6. R. Obermark, "Distributed Deadlock Detection Algorithm", ACM Trans. on Database Systems, Vol. 7, No. 2, June 1982, pp. 187–208.

    Article  Google Scholar 

  7. J. L. Peterson & A. Silberschatz, "Operating System Concepts", Addison — Wesley, 1985.

    Google Scholar 

  8. G. Ricart & A. K. Agrawala, "An Optimal Algorithm for Mutual Exclusion in Computer Networks", Communications of the ACM, Vol. 24, No. 1, January 1981, pp. 9–17.

    Article  Google Scholar 

  9. M. K. Sinha & N. Natarajan, "A Priority Based Distributed Deadlock Detection Algorithm", IEEE Trans. on Software Engineering, Vol. 11, No. 1, January 1985, pp. 67–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departement of Computer Science, Lund University, Sweden

    Ferenc Belik

Authors
  1. Ferenc Belik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Belik, F. (1988). A distributed deadlock avoidance technique. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019801

Download citation

  • DOI: https://doi.org/10.1007/BFb0019801

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation