Thumbnail
Access Restriction
Subscribed

Author Frailey, Dennis J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Deadlock ♦ Multiprocessing ♦ Deadly embrace ♦ Resource allocation ♦ Scheduling ♦ Multiprogramming ♦ Resource management ♦ Time-sharing
Abstract Resource scheduling and allocation can be expensive with regard to time and space in multiprogramming or time-sharing environments involving large numbers of tasks and resources with conflicting requirements. Detection and/or prevention of deadlocks can require massive amounts of additional overhead if efficient usage of resources is to be maintained.A resource management program is described which uses linked lists along with other techniques to overcome a large portion of this overhead. The program, which is currently running as part of a large scale general purpose operating system, keeps resources relatively active but does not detect or prevent all deadlocks in its implemented state. Certain changes, which would permit more comprehensive levels of deadlock prevention/detection at additional cost, have not been incorporated in the running system due to the infrequency of deadlock situations.
Description Affiliation: Southern Methodist Univ., Dallas, TX (Frailey, Dennis J.)
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 16
Issue Number 5
Page Count 7
Starting Page 323
Ending Page 329


Open content in new tab

   Open content in new tab
Source: ACM Digital Library