Skip to main content
Springer Nature Link
Log in

A partially distributed deadlock detection algorithm

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In this paper, a partially distributed deadlock detection algorithm [PDDDA] with multiple outstanding requests is presented for use in distributed database systems. This algorithm allows a process to request many resources simultaneously and uses a central controller for detecting multisite deadlocks. The detection of local deadlocks and the maintenance of local deadlock information are performed at each of the local sites. This partially distributed algorithm alleviates the problem of congestion at the central controller in a centralized algorithm and needs fewer messages and smaller storage space than a fully decentralized algorithm. A set of criteria for comparing deadlock detection algorithms are also given and then used to compare PDDDA with a fully decentralized algorithm proposed by Isloor and Marsland.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. W. Chu and G. Ohlmacher, Avoiding Deadlock in Distributed Data Bases,Proceedings of the ACM National Conference: pp. 150–160, (November 1974).

  2. A. K. Elmagarmid,Deadlock Detection and Resolution in Distributed Processing Systems, Ph. D. Thesis, The Ohio State University, (August 1985).

  3. S. Mahmoud and J. S. Riordon, Software Controlled Access to Distributed Data Bases,INFOR 15(1):1–19 (February 1980).

    Google Scholar 

  4. B. Goldman,Deadlock Detection in Computer Networks, Technical Report 185, MIT/LCS, (September 1977).

  5. S. Kawazu, S. Minami, K. Itoh, and K. Teranaka, Two-phase Deadlock Detection Algorithm in Distributed Databases, In5th Intnl. Conf. On Very Large Databases, IEEE Computer Society, pp. 360–367 (1979).

  6. J. E. Moss,Nested Transactions: An Approach to Reliable Distributed Computing, Pf. D. Thesis, Dept. of Electrical Engineering and Computer Science MIT. (April 1981).

  7. R. Obermarck,Deadlock Detection for All Classes, IBM Research Report RJ2955, IBM, (October 1980).

  8. R. Obermarck, Distributed Deadlock Detection Algorithm,CM TODS 7(2):187–208, (June 1982).

    Google Scholar 

  9. D. Zobel, The Deadlock Problem: A Classifying Bibliography,Operating Systems Review 17(2):6–15, (October 1983).

    Google Scholar 

  10. S. Isloor and T. A. Marsland, The Deadlock Problem: An Overview,IEEE Computer 13(9):58–72, (September 1980).

    Google Scholar 

  11. J. Gray, P. Roman, H. Korth, and R. Obermack,A Straw Man Analysis of the Probability of Waiting and Deadlock in a Database System, sa Research Report RJ3066, IBM Research Lab., San Jose, California, (February 1981).

    Google Scholar 

  12. T. Marsland and S. S. Isloor, Detection of Deadlocks in Distributed Database Systems,INFOR 18(1):1–19 (February 1980).

    Google Scholar 

  13. V. Gligor and S. Shattuk, On Deadlock Detection In Distributed Systems.IEEE Trans. On Softw. Engin. 6(5):435–440, (September 1980).

    Google Scholar 

  14. W. C. Tsai,Distributed Deadlock Detection in Distributed Database System. Ph. D. thesis, University of Illinois at Urbana-Champaign, (1982).

  15. J. R. Jagannathan and R. Vasunderan,A Distributed Deadlock Detection and Resolution Scheme: Performance Study, The 3rd Intl. Conf. on Distributed Computing Systems: pp. 496–501 (October 1982).

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Program, Department of Electrical Engineering, Pennsylvania State University, 16802, University Park, Pennsylvania

    Ahmed K. Elmagarmid

  2. Honeywell Computer Sciences Center, 1000 Boone Ave. N., 55427, Golden Valley, Minnesota

    Amit P. Sheth

  3. Department of Computer and Information Science, Ohio State University, 43210-1277, Columbus, Ohio

    Ming T. Liu

Authors
  1. Ahmed K. Elmagarmid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amit P. Sheth
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ming T. Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research reported herein was supported by US Army CECOM, Ft. Monmouth, New Jersey, under Contract No. DAAB07-83-K-K542. The views, opinions, and/or findings contained in this paper are those of the authors and should not be construed as an official Deportment of the Army position, policy or decision.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elmagarmid, A.K., Sheth, A.P. & Liu, M.T. A partially distributed deadlock detection algorithm. International Journal of Computer and Information Sciences 14, 307–330 (1985). https://doi.org/10.1007/BF00987040

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words