Home → Magazine Archive → January 1971 (Vol. 14, No. 1) → Comments on prevention of system deadlocks → Abstract

Comments on prevention of system deadlocks

By Richard C. Holt

Communications of the ACM, Vol. 14 No. 1, Pages 36-38

Save PDF
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.

The full text of this article is premium content


No entries found