Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

C. L. Liu; J. W. Layland · Journal of the ACM · 1973

Resource page

Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.

Author / responsible party

C. L. Liu; J. W. Layland

Publisher

Journal of the ACM

Year

1973

Language

English

Resource access

Open the content from the main option or choose another available source.

OpenAlex OpenAlex Works

Entrar por OpenAlex

Main access

Resource page

Resource reference page. Full text availability has not been automatically confirmed.

Open resource

Summary

Descripción general del contenido del recurso.

The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Liu, C. L. & Layland, J. W. (1973). Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. https://doi.org/10.1145/321738.321743

MLA

Liu, C. L, and J. W. Layland. "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment." 1973. https://doi.org/10.1145/321738.321743.

Chicago

Liu, C. L. and J. W. Layland. 1973. "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment.". https://doi.org/10.1145/321738.321743.

Harvard

Liu, C. L. and Layland, J. W. 1973, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM, available at: https://doi.org/10.1145/321738.321743 [Accessed 7 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Author / contributors: C. L. Liu; J. W. Layland

Publisher: Journal of the ACM

Publication year: 1973

Language: English

Subjects

Explore related resources through these subjects.

Computer multitasking; Computer science; Scheduling (production processes); Fixed-priority pre-emptive scheduling; Earliest deadline first scheduling; Parallel computing; Fair-share scheduling; Distributed computing; Dynamic priority scheduling; Rate-monotonic scheduling; Algorithm; Real-time computing