Deadlock-free Sharing of Resources in Asynchornous Systems
Name
MIT-LCS-TR-075.pdf
Size
3.55 MB
Format
Adobe PDF
Checksum (MD5)
1215611e85186fdd0adad2a98b0b4490
Author(s)
Hebalkar, Prakash G.
Advisor(s)
Dennis, Jack B.
Date Issued
September 1970
Series/Report no.
MIT-LCS-TR-075
MAC-TR-075
Abstract
Whenever resources are shared among several activities that hoard resources, the activities can attain a state of deadlock in which, for lack of resources, none of the activities can proceed. Deadlocks can be prevented by coordination of the sharing. efficient running of the activities under such coordination requires knowledge of the patterns of use of resources by the activities.
Persistent DSpace Link