Scheduling according to job priority with prevention of deadlock and permanent blocking

Abstract

Some job scheduling algorithms have been developed which prevent deadlock and permanent blocking. The jobs are assumed to be ordered according to a priority rule indicating the order in which requests for resources should be considered. Each job has an upper limit on the resources demanded, and each job will eventually return all resources allocated to it. The main advantages of the developed algortihms are: A. New low priority jobs will never block older higher priority jobs. B. Requests are always granted if they cannot delay higher priority jobs. C. Any priority rule may be chosen. New low priority jobs will never block older higher priority jobs. Requests are always granted if they cannot delay higher priority jobs. Any priority rule may be chosen.

DOI: 10.1007/BF00289247

Cite this paper

@article{MunchAndersen1977SchedulingAT, title={Scheduling according to job priority with prevention of deadlock and permanent blocking}, author={Bo Munch-Andersen and Torben U. Zahle}, journal={Acta Informatica}, year={1977}, volume={8}, pages={153-175} }