Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Chung Laung Liu, J. W. Layland
Journal of the ACM · 1973 · 8,603 citationsOpen access
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Liu, C. L., & Layland, J. W. (1973). Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1), 46–61. https://doi.org/10.1145/321738.321743
In text: (Liu & Layland, 1973)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
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.
Related papers
- Array programming with NumPy2020
- MapReduce2008
- LINCS: A linear constraint solver for molecular simulations1997
- GROMACS 4: Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation2008
- LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales2021
Metadata from OpenAlex (CC0). Citations are generated from the published record.