A polynomial-time test for the deadlock-freedom of computer systems
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).
KeywordsAllocation Policy Process Node Resource Type Resource Unit Network Flow Problem
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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