Abstract
A new approach to the avoidance of system deadlocks is based on the notion of promoting a process to a higher rank when a resource is allocated to it. An advantage of this method is that it can prevent the occurrence, and therefore avoid the dynamic safety test, of many unsafe allocation states. Also, an algorithm that tests how many resources can safely be allocated is easily found and the method makes it possible to attach a cost factor to resource allocation depending on the demand and the allocation test.
This research was supported by the National Science Foundation under Contract No. GJ 32259.
Preview
Unable to display preview. Download preview PDF.
References
Habermann, A. N., Prevention of system deadlocks, CACM 12, July 1969.
Holt, R. C., Some deadlock properties of computer systems, Operating Systems Review 6, June 1972, 64–71.
Russell, R. D., A model for deadlock-free resource allocation (thesis), SLAC Report No. 148, Stanford Linear Acceleration Center, Stanford, Calif., June 1972.
Holt, R. C., On deadlock in computer systems (thesis), Computer Science Department, Cornell University, Ithaca, N. Y., December 1970.
Dykstra, E. W., Cooperating sequential processes, Programming Systems, Genuys ed., Academic Press, London, 1968.
Coffman, E. G., Jr., M. J. Elphick, A. Soshani, System deadlocks, Computing Surveys 3, June 1971, 67.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habermann, A.N. (1974). A new approach to avoidance of system deadlocks. In: Gelenbe, E., Kaiser, C. (eds) Operating Systems. OS 1974. Lecture Notes in Computer Science, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029358
Download citation
DOI: https://doi.org/10.1007/BFb0029358
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06849-5
Online ISBN: 978-3-540-37805-1
eBook Packages: Springer Book Archive