Skip to main content

Advertisement

Springer Nature Link
Log in

Deadlock-freedom in resource contentions

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The paper establishes two necessary and sufficient conditions for the absence of deadlock in resource contentions under the expedient allocation policy. Their equivalence is proved. One of these was discovered independently by Ibaraki and Kameda. The conditions are essentially the condition of the König-Hall Theorem for the existence of a system of distinct representatives. If there are no multiple resources the conditions simplify to the condition for acyclicity of hypergraphs.

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. Berge, C.: Graphs and Hypergraphs. Amsterdam: North-Holland 1973

    Google Scholar 

  2. Chen, M.C., Graham, R.L., Rem, M.: A characterization of deadlock free resource contentions. Technical Report 4684, Computer Science Department, California Institute of Technology. Pasadena, CA 1982

    Google Scholar 

  3. Dijkstra, E.W.: Cooperating sequential processes. In: Programming Languages, pp. 43–112. F. Genuys (ed.). New York: Academic Press 1968

    Google Scholar 

  4. Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf. 1, 115–138 (1971)

    Google Scholar 

  5. Habermann, A.N.: Prevention of system deadlocks. Commun. ACM 12, 373–377, 385 (1969)

    Google Scholar 

  6. Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26–30 (1935)

    Google Scholar 

  7. Holt, R.C.: Some deadlock properties of computer systems. Comput. Surv. 4, 179–196 (1972)

    Google Scholar 

  8. Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225–231 (1973)

    Google Scholar 

  9. Ibaraki, T., Kameda, T.: Deadlock-free systems for a bounded number of processes. IEEE Trans. Comput. 31, 188–193 (1982)

    Google Scholar 

  10. Kameda, T.: Testing deadlock-freedom of computer systems. J. Assoc. Comput. Mach. 27, 270–280 (1980)

    Google Scholar 

  11. Mead, C.A., Conway, L.A.: Introduction to VLSI Systems. Reading, MA: Addison Wesley 1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, 10 Hillhouse Avenue, P.O. Box 2158, 06520, Yale Station, New Haven, CT, USA

    Marina C. Chen

  2. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600, MB Eindhoven, The Netherlands

    Martin Rem

Authors
  1. Marina C. Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Martin Rem
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

This work was sponsored by the Defense Advanced Research Projects Agency ARPA Order 3771 and monitored by the Office of Naval Research under Contract N00014-79-C-0597. It was carried out at the California Institute of Technology

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, M.C., Rem, M. Deadlock-freedom in resource contentions. Acta Informatica 21, 585–598 (1985). https://doi.org/10.1007/BF00289712

Download citation

  • Received:

  • Issue Date:

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

Keywords