The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Testing Deadlock-Freedom of Computer Systems
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Communicating sequential processes
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
An exercise in proving parallel programs correct
Communications of the ACM
Compact finite difference schemes for ocean models: 1. Ocean waves
Journal of Computational Physics
The Logical Design of Operating Systems
The Logical Design of Operating Systems
Operating system principles
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
A survey of distributed deadlock detection algorithms
ACM SIGMOD Record
Preventing deadlocks and starvation in distributed object oriented systems
Computers and Electrical Engineering
| Hi-index | 0.00 |
This paper reexamines deadlock prevention in the context of multiprocessor or distributed systems. The essential idea is to have a deadlock prevention process that executes “on-the-fly”, i.e. in parallel with processes that use resources. The prevention process determines in advance those requests that could be satisfied. The effect of this approach is to reduce greatly the overhead imposed by deadlock prevention. The contributions of the paper are an efficient algorithm for predicting which requests could be granted and efficient process interaction protocols for on-the-fly prevention. The predictor algorithm is also used for efficient determination of delayed requests that can be granted after a release.