Advertisement

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

  • T. Kameda
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)

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).

Keywords

Allocation Policy Process Node Resource Type Resource Unit Network Flow Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. 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. 2.
    Coffman, E.G. Jr., Elphick, M.J. and Shoshani, A. System deadlocks. Computing Surveys 2, 4 (June 1971), 67–78.CrossRefGoogle Scholar
  3. 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. 4.
    Ford, L.R. and Fulkerson, D.R. Flows in Networks, Princeton University Press, Princeton, 1962.Google Scholar
  5. 5.
    Habermann, A.N. Prevention of System deadlocks. Comm. ACM 12, 7 (July 1969), 373–377, 385.CrossRefGoogle Scholar
  6. 6.
    Havender, J.W. Avoiding deadlock in multi-tasking systems. IBM Systems J. 2, 7 (July 1968), 74–84.Google Scholar
  7. 7.
    Holt, R.C. On deadlock in computer systems. Tech. Rept. CSRG-6, Univ. Toronto, Jan. 1971.Google Scholar
  8. 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.CrossRefGoogle Scholar
  9. 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. 10.
    Shaw, A. The Logical Design of Operating Systems, Prentice-Hall Englewood Cliffs, N.J., 1974, p. 230.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • T. Kameda

There are no affiliations available

Personalised recommendations