Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor

Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor (1990)

Cached

Download Links

[www.cs.unc.edu]

Other Repositories/Bibliography

DBLP

by Sanjoy K. Baruah , Rodney R. Howell , Louis Rosier

Venue:	Real-Time Systems
Citations:	137 - 13 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor	user correction - Legacy Corrections
AUTHOR NAME	Sanjoy K. Baruah	user correction - Legacy Corrections
AUTHOR AFFIL	Dept. of Computer Sciences; The University of Texas at Austin	user correction - Legacy Corrections
AUTHOR ADDR	Austin, TX 78712	user correction - Legacy Corrections
AUTHOR NAME	Rodney R. Howell	user correction - Legacy Corrections
AUTHOR AFFIL	Dept. of Computing and Information Sciences; Kansas State University	user correction - Legacy Corrections
AUTHOR ADDR	Manhattan, KS 66506	user correction - Legacy Corrections
AUTHOR NAME	Louis Rosier	user correction - Legacy Corrections
AUTHOR AFFIL	Dept. of Computer Sciences; The University of Texas at Austin	user correction - Legacy Corrections
AUTHOR ADDR	Austin, TX 78712	user correction - Legacy Corrections
ABSTRACT	We investigate the preemptive scheduling of periodic, real-time task systems on one processor. First, we show that when all parameters to the system are integers, we may assume without loss of generality that all preemptions occur at integer time values. We then assume, for the remainder of the paper, that all parameters are indeed integers. We then give as our main lemma both necessary and sufficient conditions for a task system to be feasible on one processor. Although these conditions cannot, in general, be tested efficiently (unless P = NP), they do allow us to give efficient algorithms for deciding feasibility on one processor for certain types of periodic task systems. For example, we give a pseudo-polynomial time algorithm for synchronous systems whose densities are bounded by a fixed constant less than 1. This algorithm represents an exponential improvement over the previous best algorithm. We also give a polynomial-time algorithm for systems having a fixed number of distinct typ...	user correction - Legacy Corrections
YEAR	1990	INFERENCE
VENUE	Real-Time Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	301--324	INFERENCE
VOLUME	2	INFERENCE
CITATIONS	17 found	ParsCit 1.0