Algorithms for scheduling real-time tasks with input error and end-to-end deadlines

This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real-time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1997-02, Vol.23 (2), p.93-106
Main Authors: Wu-Chun Feng, Liu, J.W.-S.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Computer applications
Computer based modeling
Computer science
control theory
systems
Deadlines
Degradation
Distributed computing
Error correction
Exact sciences and technology
Processor scheduling
Real time
Real time systems
Robustness
Schedules
Scheduling
Scheduling algorithm
Software
Software engineering
Studies
Timing
Video compression
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real-time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing times of its mandatory and optional parts may become larger. The composite tasks are scheduled by a two-level scheduler. At the high level, the composite tasks are scheduled preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of the composite task.
ISSN:0098-5589
1939-3520
DOI:10.1109/32.585499