iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/3-540-51687-5_44
Distributed deadlock detection and resolution with probes | SpringerLink
Skip to main content
Springer Nature Link
Log in

Distributed deadlock detection and resolution with probes

  • 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

We derive an algorithm for distributed deadlock detection and resolution which uses probes and allows an arbitrary priority scheme to choose a victim to abort after a deadlock has been detected. This algorithm is remarkable in that at least three incorrect versions of it have previously been published ([SiNa],[CKST87],[CKST89]). With careful attention to the properties of the wait-for-graph of the single resource model and definition of a simple and uniform framework for the underlying system, we are able to give an understandable and convincing derivation of the algorithm.

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.

Similar content being viewed by others

References

  1. A.N. Choudhary, W.H. Kohler, J.A. Stankovic, D. Towsley. "A Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution" Proceeding of the 7th International Conference on Distributed Systems 1987. pp 162–168.

    Google Scholar 

  2. A.N. Choudhary, W.H. Kohler, J.A. Stankovic, D. Towsley. “A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution" IEEE Trans on Soft Eng. 15:1, January 1989. pp 10–17.

    Google Scholar 

  3. Edgar Knapp. "Deadlock Detection in Distributed Databases" ACM Computing Surveys, 19:4. December 1987.

    Google Scholar 

  4. Don Mitchell and Michael Merritt. "A Distributed Algorithm for Deadlock Detection and Resolution" Proceedings of the AMC Symposium on Principles of Distributed Computing. pp 282–284. 1984

    Google Scholar 

  5. M. K. Sinha and N. Natarajan, "A Priority Based Distributed Deadlock Detection Algorithm" IEEE Trans on Soft Eng. SE-11:1. January 1985. pp 67–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Computersysteme Swiss Federal Institute of Technology (ETH Zürich), ETH Zentrum, CH-8092, Zürich, Switzerland

    Beverly A. Sanders

  2. Sonnenweg 4, CH-8370, Sirnach, Switzerland

    Philipp A. Heuberger

Authors
  1. Beverly A. Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philipp A. Heuberger
    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

Sanders, B.A., Heuberger, P.A. (1989). Distributed deadlock detection and resolution with probes. 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_44

Download citation

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

  • 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