Thumbnail
Access Restriction
Subscribed

Author Holt, Richard C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Deadlock ♦ Deadly embrace ♦ Resource allocation ♦ Scheduling ♦ Lockout ♦ Multiprogramming ♦ Interlock ♦ Knotting ♦ Time-sharing
Abstract 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.
Description Affiliation: Cornell Univ., Ithaca, NY (Holt, Richard C.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 14
Issue Number 1
Page Count 3
Starting Page 36
Ending Page 38


Open content in new tab

   Open content in new tab
Source: ACM Digital Library