Skip to main content
SpringerLink
Log in

A polynomial-time test for the deadlock-freedom of computer systems

  • Vorträge In Der Reihenfolge Des Programms
  • Conference paper
  • First Online:
Theoretical Computer Science

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

  • 153 Accesses

Abstract

We call a system of n processes sharing m reusable resources deadlock-free, if and only if the allocation policy which automatically grants any request that can be granted with currently free resource units never leads to a deadlock. The best known test for deadlock-freedom is essentially enumerative. We present a test employing a network-flow technique, which works in time bounded by O(n3m).

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.

Literatur

  1. Aho, A.V., Hopcroft, J.E. and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.

    Google Scholar 

  2. Coffman, E.G. Jr., Elphick, M.J. and Shoshani, A. System deadlocks. Computing Surveys 2, 4 (June 1971), 67–78.

    Article  Google Scholar 

  3. Dijkstra, E.W. Cooperating sequential processes. EWD 123, Math. Dept., Technological Univ., Eindhoven, The Netherlands, 1965. Also in "Programming Languages" (Genuys, F. Ed.), Academic Press, New York, 1968, 43–112.

    Google Scholar 

  4. Ford, L.R. and Fulkerson, D.R. Flows in Networks, Princeton University Press, Princeton, 1962.

    Google Scholar 

  5. Habermann, A.N. Prevention of System deadlocks. Comm. ACM 12, 7 (July 1969), 373–377, 385.

    Article  Google Scholar 

  6. Havender, J.W. Avoiding deadlock in multi-tasking systems. IBM Systems J. 2, 7 (July 1968), 74–84.

    Google Scholar 

  7. Holt, R.C. On deadlock in computer systems. Tech. Rept. CSRG-6, Univ. Toronto, Jan. 1971.

    Google Scholar 

  8. Holt. R.C. Some deadlock properties of computer systems. Proc. Third Ann. Symp. Oper. Syst. Principles, Stanford, Oct. 1971, 64–71. Also Computing Surveys 4,3 (Sept. 1972), 179–196.

    Article  Google Scholar 

  9. Reiter, A. A resource-allocation scheme for multi-user on-line operation of a small computer. Proc. AFIPS 1967 Spring J.C.C. Vol. 30, Thompson Book Co., Washington, D.C., 1–7.

    Google Scholar 

  10. Shaw, A. The Logical Design of Operating Systems, Prentice-Hall Englewood Cliffs, N.J., 1974, p. 230.

    Google Scholar 

Download references

Authors
  1. T. Kameda
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kameda, T. (1977). A polynomial-time test for the deadlock-freedom of computer systems. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-08138-0_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08138-8

  • Online ISBN: 978-3-540-37389-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation