Scheduling distributed real-time tasks with minimum jitter
Di Natale, M.
Stankovic, J.A.
Pisa Univ.;
This paper appears in: Computers, IEEE Transactions on
Publication Date: Apr 2000
Volume: 49,
Issue: 4
On page(s): 303-316
ISSN: 0018-9340
References Cited: 32
CODEN: ITCOB4
INSPEC Accession Number: 6612195
Digital Object Identifier: 10.1109/12.844344
Current Version Published: 2002-08-06
Abstract
The problem of scheduling real-time tasks with minimum jitter is
particularly important in many control applications; nevertheless, it
has rarely been studied in the scientific literature. This paper
presents an unconventional scheduling approach for distributed static
systems where tasks are periodic and have arbitrary deadlines,
precedence, and exclusion constraints. The solution presented in this
work not only creates feasible schedules, but also minimizes jitter for
periodic tasks. We present a general framework consisting of an abstract
architecture model and a general programming model. We show how to
design a surprisingly simple and flexible scheduling method based on
simulated annealing. Experimental results demonstrate the significant
improvement of our algorithm over earliest deadline first and rate
monotonic algorithms
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
