A new approach to avoidance of system deadlocks

  • A. N. Habermann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 16)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Habermann, A. N., Prevention of system deadlocks, CACM 12, July 1969.Google Scholar
  2. [2]
    Holt, R. C., Some deadlock properties of computer systems, Operating Systems Review 6, June 1972, 64–71.CrossRefGoogle Scholar
  3. [3]
    Russell, R. D., A model for deadlock-free resource allocation (thesis), SLAC Report No. 148, Stanford Linear Acceleration Center, Stanford, Calif., June 1972.Google Scholar
  4. [4]
    Holt, R. C., On deadlock in computer systems (thesis), Computer Science Department, Cornell University, Ithaca, N. Y., December 1970.Google Scholar
  5. [5]
    Dykstra, E. W., Cooperating sequential processes, Programming Systems, Genuys ed., Academic Press, London, 1968.Google Scholar
  6. [6]
    Coffman, E. G., Jr., M. J. Elphick, A. Soshani, System deadlocks, Computing Surveys 3, June 1971, 67.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • A. N. Habermann
    • 1
  1. 1.Department of Computer ScienceCarnegie-Mellon UniversityPittsburgh

Personalised recommendations