skip to main content
10.1145/18172.18214acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Local distributed deadlock detection by knot detection

Authors Info & Claims
Published:01 August 1986Publication History

ABSTRACT

A distributed algorithm for the detection of deadlocks in store-and-forward communication networks is presented. At first, we focus on a static environment and develop an efficient knot detection algorithm for general graphs. The knot detection algorithm uses at most Ο(n2 + m) messages and Ο(log(n)) bits of memory to detect all deadlocked nodes in the static network. Using the knot detection algorithm as a building block, a deadlock detection algorithm in a dynamic environment is developed. This algorithm has the following properties: It detects all the nodes which cause the deadlock. The algorithm is triggered only when there is a potential for deadlock and only those nodes which are potentially deadlocked perform the algorithm. The algorithm does not affect other processes at the nodes.

References

  1. 1.K.D. Gunther, "Prevention of Deadlocks in Packet-Switched Data Transport Systems," IEEE Transactions on Communications, special issue on Congestion Control in Computer Networks, Vol. COM-29, No. 6, pp. 512-524.Google ScholarGoogle Scholar
  2. 2.P. M. Merlin and P. J. Schweitzer, "Deadlock Avoidance in Store-and-Forward Networks - i: Store and Forward Deadlock," IEEE Transactions on Communications Vol. COM-28, No. 3, March 1980.Google ScholarGoogle Scholar
  3. 3.G.A. Grover and J.M. Jaffe, "Standoff Resolution in Computer Communication Networks," IBM Research Report RCl1009, submitted to IEEE Transactions on Communications.Google ScholarGoogle Scholar
  4. 4.R. Obermarck, "Distributed Deadlock Detection Algorithm", ACM Trans. Database Syst., Vol. 7,2, (June 1982), pp. 187-208. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.K.M. Chandy, J. Misra and L.M. Haas, "Distributed Deadlock Detection", A CM Transactions on Computer Systems, Vol. 1, No. 2, May 1983, pp. 144-156. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.K.M. Chandy and J. Misra, "A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems", in Proc. A CM SIGA CT-SIGOPS Syrup. Principles of Distributed Computing (Ottawa, Canada, Aug. 1982), ACM, New York, 1983, pp. 157-164. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.G. Gambosi, D.P. Borer and D.A. Menascoe, "A Detection and Removal of Deadlocks in Store and Forward Communication Networks", in Performance of Computer-Communication Systems (H. Rudin and W. Bux eds.), Elsevier Science Publishers B.V. (North Holland), 1984, pp. 219-229.Google ScholarGoogle Scholar
  8. 8.I. Cidon, J. M. Jaffe and M. Sidi, "Local Distributed Deadlock Detection with Finite Buffers," IBM Israel Scientific Center Technical Report 88.154, April 1985.Google ScholarGoogle Scholar
  9. 9.I. Cidon, J. M. Jaffe and M. Sidi, "Global Distributed Deadlock Detection and Resolution with Finite Buffers," IBM Israel Scientific Center Technical Report, 88.161, July 1985.Google ScholarGoogle Scholar
  10. 10.J. Misra and K.M. Chandy, "A Distributed Graph Algorithm: Knot Detection", A CM Transactions on Programming Languages and Systems, Vol. 4, No. 4, October 1982, pp. 678-686. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.G. Bracha and S. Toueg, "A Distributed Algorithm for Generalized Deadlock Detection", Symposium on the Principles of Distributed Computing, October 1984, pp. 285-301. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.D. P. Mitchell and M. J. Merritt, "A Distributed Algorithm for Deadlock Detection and Resolution", Symposium on the Principles of Disn'ibuted Computing, October 1984, pp. 282-284. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.P. A. Humblet, "A Distributed Algorithm for Minimuln Weight Directed Spanning Trees", IEEE Transactions on Communications, Vol. COM-31, No. 6, June 1983, pp. 756-762.Google ScholarGoogle Scholar
  14. 14.E. Gafni and Y. Afek, "Election and Traversal in Unidirectional Networks", UCLA Computer Science Department.Google ScholarGoogle Scholar
  15. 15.I. Cidon, J. M. Jaffe and M. Sidi, "Local Distributed Deadlock Detection by Cycle Detection and Clustering", IBM Israel Scientific Center Technical Report, 88.164, July 1985.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    SIGCOMM '86: Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
    September 1986
    414 pages
    ISBN:0897912012
    DOI:10.1145/18172
    • cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 16, Issue 3
      Aug. 5, 1986
      392 pages
      ISSN:0146-4833
      DOI:10.1145/1013812
      Issue’s Table of Contents

    Copyright © 1986 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 August 1986

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate554of3,547submissions,16%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader