scispace - formally typeset
Journal ArticleDOI

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

TLDR
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 and it is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization.
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.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Priority inheritance protocols: an approach to real-time synchronization

TL;DR: An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol, both of which solve the uncontrolled priority inversion problem.
Proceedings ArticleDOI

The rate monotonic scheduling algorithm: exact characterization and average case behavior

TL;DR: An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set and a stochastic analysis which gives the probability distribution of the breakdown utilization of randomly generated task sets are represented.
Proceedings ArticleDOI

A scheduling model for reduced CPU energy

TL;DR: This paper proposes a simple model of job scheduling aimed at capturing some key aspects of energy minimization, and gives an off-line algorithm that computes, for any set of jobs, a minimum-energy schedule.
Proceedings ArticleDOI

Real-time dynamic voltage scaling for low-power embedded operating systems

TL;DR: This paper presents a class of novel algorithms that modify the OS's real-time scheduler and task management service to provide significant energy savings while maintaining real- time deadline guarantees, and shows that these RT-DVS algorithms closely approach the theoretical lower bound on energy consumption.
Journal ArticleDOI

On the complexity of fixed-priority scheduling of periodic, real-time tasks

TL;DR: It is shown that the problem is NP-hard in all but one special case and the complexity of optimal fixed-priority scheduling algorithm is discussed.
References
More filters
Journal ArticleDOI

Bounds for certain multiprocessing anomalies

TL;DR: In this paper, precise bounds are derived for several anomalies of this type in a multiprocessing system composed of many identical processing units operating in parallel, and they show that an increase in the number of processing units can cause an increased total length of time needed to process a fixed set of tasks.
Journal ArticleDOI

Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

TL;DR: 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.
Journal ArticleDOI

A scheduling philosophy for multiprocessing systems

TL;DR: 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.
Journal ArticleDOI

Production and Stabilization of Real-Time Task Schedules

TL;DR: 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.
Journal ArticleDOI

A Survey of Analytical Time-Sharing Models

TL;DR: 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.
Related Papers (5)