Skip to main content
SpringerLink
Log in

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

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

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:

  1. A.

    New low priority jobs will never block older higher priority jobs.

  2. B.

    Requests are always granted if they cannot delay higher priority jobs.

  3. C.

    Any priority rule may be chosen.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of scheduling. Reading (Mass.): Addison-Wesley 1967

    Google Scholar 

  2. Dijkstra, E.W.: A class of allocation strategies inducing bounded delays only. Proc. AFIPS 1972 SJCC, Vol. 40, pp. 933–936. Montvale (N.J.): AFIPS Press 1972

    Google Scholar 

  3. Habermann, A.N.: Prevention of system deadlocks. Comm. ACM 12, 373–377, 385 (1969)

    Article  Google Scholar 

  4. Habermann, A.N.: A new approach to avoidance of system deadlocks, in operating systems. In: Proc. Internatl. Symposium, Rocquencourt, April 1974, pp. 169–176. Berlin-Heidelberg-New York: Springer 1974

    Google Scholar 

  5. Holt, R.C.: Comments on prevention of system deadlocks. Comm. ACM. 14. 36–38 (1971)

    Article  Google Scholar 

  6. Holt, R.C.: Some deadlock properties of computer systems, Comp. Surveys 4, 179–196 (1972)

    Article  Google Scholar 

  7. Landy, B.: Development of scheduling strategies in the TITAN operating system. Software-Practice and Experience 1, 279–295 (1971)

    Google Scholar 

  8. Lauesen, S.: Job scheduling guaranteing reasonable turn-around times. Acta Informatica 2, 1–11 (1973)

    Google Scholar 

  9. Parnas, D.L., Habermann, A.N.: Comment on deadlock prevention method (with a reply by R.C. Holt). Comm. ACM 15, 841–842 (1972)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Road Data Processing, Stationsalléen 42, DK-2730, Herlev, Denmark

    Bo Munch-Andersen

  2. Datalogisk Institut, Copenhagen University, Sig-urdsgade 41, DK-2200, Copenhagen N, Denmark

    Torben U. Zahle

Authors
  1. Bo Munch-Andersen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torben U. Zahle
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Munch-Andersen, B., Zahle, T.U. Scheduling according to job priority with prevention of deadlock and permanent blocking. Acta Informatica 8, 153–175 (1977). https://doi.org/10.1007/BF00289247

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289247

Keywords

Search

Navigation