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

  • Authors:
  • C. L. Liu;James W. Layland

  • Affiliations:
  • Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL and Project MAC, Massachusetts Institute of Technology;Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1973

Quantified Score

Hi-index 0.35

Visualization

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.