Comments on prevention of system deadlocks
Communications of the ACM
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
Parallel resource allocation algorithms on macro-pipelined architectures
CSC '91 Proceedings of the 19th annual conference on Computer Science
On the probability of deadlock in computer systems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
The Deadlock problem: a classifying bibliography
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
In computer systems in which resources are allocated dynamically, algorithms must be executed whenever resources are assigned to determine if the allocation of these resources could possibly result in a deadlock, a situation in which two or more processes remain in an idle or blocked state indefinitely. In previous research, execution of the process requesting resources is suspended while an algorithm is executed to determine that the assignment could not cause a deadlock. In this paper, an algorithm is used to calculate all possible safe requests before they are made. This algorithm is executed concurrently with other processes between requests for resource allocations. If the determination of all safe requests has been completed and a process makes a request, the calculations required by the resource allocation are trivial.