Comments on Prevention of System Deadlocks

Habermann's method of deadlock prevention is
discussed, where deadlock is defined as a system 
state from which resource allocations to certain processes
are not possible.  It is shown that the scheduler 
may introduce "artificial" deadlocks which Habermann's
method does not prevent.  Permanent blocking is 
the situation where certain processes never receive their
resource requests.  It is shown that deadlock 
prevention does not necessarily eliminate permanent blocking.
 A method of preventing permanent blocking 
is given.

CACM January, 1971

Holt, R. C.

multiprogramming, time-sharing, scheduling, resource
allocation, deadlock, lockout, deadly embrace, 
knotting 

3.72 4.32 6.20

CA710106 JB February 8, 1978  10:45 AM

1781	4	2228
2150	4	2228
2150	4	2228
2228	4	2228
2228	4	2228
2228	4	2228
2256	4	2228
2256	4	2228
2280	4	2228
2317	4	2228
2342	4	2228
2342	4	2228
2376	4	2228
2379	4	2228
2482	4	2228
2618	4	2228
2618	4	2228
2740	4	2228
2851	4	2228
2920	4	2228
3184	4	2228
1198	5	2228
1338	5	2228
1877	5	2228
2228	5	2228
2228	5	2228
2228	5	2228
2280	5	2228
2379	5	2228
2482	5	2228
2500	5	2228
1749	6	2228
1749	6	2228
1877	6	2228
1877	6	2228
1877	6	2228
2228	6	2228
2228	6	2228
2228	6	2228
2228	6	2228