Skip to main content

A Fault-Tolerant Distributed Deadlock Detection Algorithm

  • Conference paper
  • First Online:

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

Abstract

In this paper, we propose a new fault-tolerant distributed deadlock detection algorithm which can handle loss of any resource release message. It is based on a token-based distributed mutual exclusion algorithm. We have evaluated and compared the performance of the proposed algorithm with two other algorithms which belong to two different classes, using simulation studies. The proposed algorithm is found to be efficient in terms of average number of messages per wait and average deadlock duration compared to the other two algorithms in all situations, and has comparable or better performance in terms of other parameters.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Menasce and R. Muntz. Locking and Deadlock Detection in Distributed Databases. IEEE Transactions on Software Engineering, SE-5(3):192–202, March 1979.

    Article  Google Scholar 

  2. Ron Obermarck. Distributed Deadlock Detection Algorithm. ACM Transactions on Database Systems, 7(2):187–208, June 1982.

    Article  Google Scholar 

  3. K. Mani Chandy, J. Misra, and Laura M. Hass. Distribued Deadlock Detection. ACM Transactions on Computer Systems, 1(2):144–156, May 1983.

    Article  Google Scholar 

  4. C. F. Yeung, S. L. Hung, Kam yiu Lam, and C. H. Law. A New Distributed Deadlock Detection Algorithm for Distributed Database Systems. In Proc. of the IEEE TENCON’94, 1994.

    Google Scholar 

  5. 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 Transactions on Software Engineering, 15(1):10–17, January 1989.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. D. Kshemkalyani and M. Singhal. Invariant Based Verification of a Distributed Deadlock Detection Algorithm. IEEE Transactions on Software Engineering, 17(8):789–799, August 1991.

    Article  Google Scholar 

  7. R. C. Hansdah and P. K. Dash. A Fault-Tolerant Token-Based Algorithm for Distributed Mutual Exclusion Using Roughly Synchronized Clocks. In Proc. of the 6th International Conference on Advanced Computing, Pune, India, pages 7–14, December 14-16, 1998.

    Google Scholar 

  8. A. N. Choudhary. Cost of Distributed Deadlock Detection: A Performance Study. In Proc. of the 6th International Conference on Data Engineering, pages 174–181, February 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hansdah, R.C., Gantait, N., Dey, S. (2002). A Fault-Tolerant Distributed Deadlock Detection Algorithm. In: Das, S.K., Bhattacharya, S. (eds) Distributed Computing. IWDC 2002. Lecture Notes in Computer Science, vol 2571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36385-8_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-36385-8_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00355-7

  • Online ISBN: 978-3-540-36385-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics