A Model for Deadlock-Free Resource Allocation [Thesis]
- SLAC National Accelerator Laboratory (SLAC), Menlo Park, CA (United States)
This paper presents an investigation of the phenomenon of deadlock in various types of resource allocation systems. A basic model of resource allocation systems is described, and assumptions about its behavior defined. The problem of deadlock is then identified and discussed in the terms of this formal model, and linear algorithms are developed to detect deadlock in a dynamic manner. A modification of the basic model is then considered to permit a more flexible type of resource control, and the deadlock phenomenon reconsidered in terms of the new system. Again a linear algorithm for deadlock detection is presented. Finally a second modification to the basic model is considered, which permits the linear algorithms already developed to be used in such a way that deadlock is prevented from occurring.
- Research Organization:
- SLAC National Accelerator Laboratory (SLAC), Menlo Park, CA (United States)
- Sponsoring Organization:
- US Atomic Energy Commission (AEC); USDOE
- NSA Number:
- NSA-26-050158
- OSTI ID:
- 4658796
- Report Number(s):
- SLAC--148; SLAC-R--148
- Country of Publication:
- United States
- Language:
- English
Similar Records
Modified algorithm for deadlock avoidance
Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection