A Spectrum of Deadlock-Avoidance Strategies
- Lookup NU author(s)
|
|
|
|
| Author(s) | | Haberrmann AN |
| Publication type | | Report |
| Series Title | | Computing Laboratory Technical Report Series |
| Year | | 1973 |
| Report Number | | 53 |
| Pages | | 34 |
|
|
|
| Full text is available for this publication: |
|
|
|
|
| Application of a deadlock-avoidance strategy can be profitable if the number of resources actually in use is less than the number claimed. Most of the system overhead introduced by such a strategy is in the allocation safety test, because this test is applied every time a resource is requested. It is shown in this report that deadlock-avoidance strategies range from most conservative to most permissive with interesting alternative strategies in between. It seems that a strategy close to the conservative policy is adequate for many resource allocation systems. Such a policy has the advantage of a simple safety test whcih requires only a fixed (and very small) number add-and-test operations. |
|
|
|
| Institution | | Computing Laboratory, University of Newcastle upon Tyne |
| Place Published | | Newcastle upon Tyne |
| URL | | http://www.cs.ncl.ac.uk/publications/trs/papers/53.pdf |
| Actions | |  |
