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

  title={Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment},
  author={C. L. Liu and James W. Layland},
  journal={J. ACM},
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… 
Multiprocessor scheduling of periodic tasks in a hard real-time environment
Preemptive scheduling a set of periodic tasks on multiprocessors is studied from the point of view of meeting their service requirements before given deadlines to derive complex algorithms including upper bounds on the number of preemptions.
Feasible processor allocation in a Hard-Real-Time environment
  • R. Henn
  • Computer Science
    Real-Time Systems
  • 2006
This article presents scheduling algorithms that guarantee all time constraints and are so easy to implement that they can be used in real-time operating systems.
Portioned static-priority scheduling on multiprocessors
  • S. Kato, N. Yamasaki
  • Computer Science
    2008 IEEE International Symposium on Parallel and Distributed Processing
  • 2008
An efficient real-time scheduling algorithm for multiprocessor platforms that achieves higher system utilizations, in which all tasks meet deadlines, with a small number of preemptions compared to traditional algorithms.
An Optimal Multiprocessor Real-Time Scheduling Algorithm
The optimal algorithm is shown to be particularly useful when schedules are built from the integral flow values obtained from the corresponding maximum flow network.
Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
  • M. Furugyan
  • Computer Science
    Programming and Computer Software
  • 2014
The problem of preemptive scheduling in a real-time multiprocessor computing system with release time/deadline intervals is investigated. Approximate algorithms based on the generalization of a
Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors
  • Björn Andersson, E. Tovar
  • Computer Science
    13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)
  • 2007
An algorithm is proposed that can schedule all task sets that any other possible algorithm can schedule assuming that the algorithm is given processors that are radic2/radic2-1ap 3.41 times faster.
Global static-priority scheduling of sporadic task systems on multiprocessor platforms
The multiprocessor scheduling of collections of real-time jobs is considered and resource-augmentation bounds are provided that quantify the tightness of these schedulability tests.
Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
An algorithm is proposed which can schedule all task sets that any other possible algorithm can schedule assuming that the algorithm is given processors that are three times faster.
Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors
It is proven that this algorithm is optimal from the perspective of achievable utilization in the sense that no fixed-priority algorithm for scheduling periodic task systems upon identical multiprocessors may have an achievable utilization greater than (m+1)/2.
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
  • S. Kato, N. Yamasaki
  • Computer Science
    2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium
  • 2009
The algorithm is designed so that a task is qualified to migrate, only if it cannot be assigned to any individual processors, in such a way that it is never returned to the same processor within the same period, once it is migrated from one processor to another processor.


Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
The authors solve the problem of scheduling a set of tasks whose operational precedence structure is representable as an acyclic directed graph and proof of an efficient algori thm for finding the minimal-length preemptive schedule for tree-structured computations.
Multiprogram scheduling: parts 1 and 2. introduction and theory
A concise scheduling algorithm is described which tends to minimize the time for executing the entire pending workload (or any subset of it), subject to external constraints such as precedence, urgency, etc.
Production and Stabilization of Real-Time Task Schedules
A coherent theory of task-list control is developed, in which the nature of peculiarities of this control scheme is brought under systematic study and a number of potentially useful results are derived.
A scheduling philosophy for multiprocessing systems
A collection of basic ideas is presented, which have been involved by various workers over the past four years to provide a suitable framework for the design and analysis of multiprocessing systems.
Multiprogram scheduling: parts 3 and 4. scheduling algorithm and external constraints
The scheduling algorithm examines the programs to be scheduled one by one and places their component rectangles in the corresponding load diagrams according to a set of placement rules.
Sequencing Aspects of Multiprogramming
The sequencing or scheduling aspects of multiprogramming are discussed, which have not been studied in mathematical detail in the machine shop scheduling context, but have been discussed under the name of job-lot MSS.
A Survey of Analytical Time-Sharing Models
The parameters which are considered in the different analytic models provide the system designer with a number of degrees of freedom with which to synthesize a t]me-shared processing system and point out needed research directions.
Bounds for certain multiprocessing anomalies
It is known that in multiprocessing systems composed of many identical processing units operating in parallel, certain timing anomalies may occur; e.g., an increase in the number of processing units
A policy-driven scheduler for a time-sharing system
The algorithm has been implemented in a general purpose operating system, and it has provided significantly better service to interactive and to batch jobs than the previous scheduler.
Certification of Algorithm 46: Exponential of a complex number
The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.