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

  title={Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment},
  author={Chung Laung 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… Expand
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. Expand
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. Expand
Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks
It is shown that optimal scheduling without a priori knowledge is impossible in the multiprocessor case even if there is no restriction on preemption owing to precedence or mutual exclusion constraints. Expand
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. Expand
The partitioned scheduling of sporadic tasks according to static-priorities
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduling on eachExpand
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 aExpand
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
A priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met, which is to be solved with global static-priority scheduling. Expand
Static-priority scheduling on multiprocessors
It is proven that this scheduling algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm and successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocesser platform. Expand
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. Expand
Performance of Algorithms for Scheduling Soft Real-Time System
In this research project the performance of two well-known scheduling policies for Real Time Systems based on fixed priority, namely Enhanced (m,k)-firm Guarantee and Weakly hard scheduling, will beExpand


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. Expand
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. Expand
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. Expand
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.Expand
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. Expand
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. Expand
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 unitsExpand
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. Expand
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. Expand