Skip to main content
SpringerLink
Log in

Variable timestamp-based distributed deadlock detection and resolution

  • Conference paper
  • First Online:
Concurrency and Parallelism, Programming, Networking, and Security (ASIAN 1996)

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

Included in the following conference series:

  • 124 Accesses

Abstract

This paper proposes a new timestamp-based distributed deadlock detection and resolution algorithm for the AND resource request model. It is different from existing distributed deadlock detection algorithms in that the timestamps we adopt are partially ordered. The timestamps are also dynamically allocated and may be modified at run-time. Compared to previous work, our algorithm can reduce the number of deadlock detections. It can achieve this without incurring additional communication costs by combining timestamp modification with deadlock detection and resolution.

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. S. Katz and O. Shmueli. Cooperative distributed algorithms for dynamic cycle prevention, IEEE Trans. Software Eng., vol. SE-13, pp. 541–553. May 1987.

    Google Scholar 

  2. M. K. Sinha and N. Natarajan. A priority based distributed deadlock detection algorithm, IEEE Trans. Software Eng., vol. SE-11, pp. 67–80. Jan. 1985.

    Google Scholar 

  3. A. N. Choudhary, W. H. Kohler, J. A. Stankovic and D. Towsley. A modified priority based probe algorithm for distributed deadlock detection and resolution, IEEE Trans. Software Eng., vol. 15. pp. 10–17. Jan. 1989

    Article  Google Scholar 

  4. A. D. Kshemkalyani and M. Sinhal. Efficient detection and resolution of generalized deadlocks, IEEE Trans. Software Eng., vol. 20. pp. 43–54. Jan. 1994.

    Article  Google Scholar 

  5. Shing-Tsaan Huang. A Distributed Deadlock Detection Algorithm for CSP-Like Communication. ACM Trans. Program. Lang. Syst., vol. 12. pp. 102–122. Jan. 1990.

    Article  Google Scholar 

  6. Y. C. Tay. What is a deadlock? Proceedings of the IFIP WG10.3 International Conference on Decentralized and Distributed Systems. September, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems and Computer Science, National University of Singapore, Singapore

    Hui Wu & Wei-Ngan Chin

Authors
  1. Hui Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei-Ngan Chin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joxan Jaffar Roland H. C. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, H., Chin, WN. (1996). Variable timestamp-based distributed deadlock detection and resolution. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027783

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62031-0

  • Online ISBN: 978-3-540-49626-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation