Show simple item record

dc.contributor.authorHolt, Richard C.en_US
dc.date.accessioned2007-04-19T17:53:09Z
dc.date.available2007-04-19T17:53:09Z
dc.date.issued1970-01en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR70-50en_US
dc.identifier.urihttps://hdl.handle.net/1813/5911
dc.description.abstractHabermann's method of deadlock preventative is discussed, where deadlock is defined as a system state from which resource allocations to certain processes is not possible. It is shown that the scheduler may introduce deadlocks which Habermann's method does not prevent. Effective deadlock is defined as the situation where certain processes do not receive their resource requests. It is shown that deadlock prevention does not imply effective deadlock prevention. A method of effective deadlock prevention is given. Key Words and Phrases: multiprogramming, time-sharing, scheduling, resource allocation, deadlock, interlock, deadly embrace, knotting.en_US
dc.format.extent465445 bytes
dc.format.extent182011 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleComments on Prevention of System Deadlocksen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics