DEADLOCK-FREE SHARING OF RESOURCES IN ASYNCHRONOUS SYSTEMS.
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. This thesis presents a study of deadlock prevention in systems in which a knowledge of the usage of resources by the activities during several phases of steady resource usage is available. A representation called a demand graph is presented and used for the study of deadlocks. The model is a general one and encompasses systems in which the activities themselves consist of more than one sequence of phases and are not necessarily independent of each other. The analysis is applicable to computer systems as well as systems in the realm of operations research. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1970
- Accession Number
- AD0713139
Entities
People
- Prakash G. Hebalkar
Organizations
- Massachusetts Institute of Technology