Name
Abstract | ||
|---|---|---|
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 |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/32.585499 | IEEE Trans. Software Eng. |
Keywords | Field | DocType |
simple imprecise task,end-to-end deadlines,existing algorithm,imprecise input,optional part,two-level scheduler,composite task,component task,scheduling real-time tasks,low-level scheduler,mandatory part,high level,input error,real time systems,robustness,degradation,error correction,scheduling,scheduling algorithm,distributed computing,video compression,computer applications,real time | Fixed-priority pre-emptive scheduling,End-to-end principle,Scheduling (computing),Reuse,Computer science,Algorithm,Imprecise computation,Real-time computing,Software development,Distributed computing | Journal |
Volume | Issue | ISSN |
23 | 2 | 0098-5589 |
Citations | PageRank | References |
39 | 2.94 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wu-chun Feng | 1 | 2812 | 232.50 |
| Jane W.-S. Liu | 2 | 1399 | 337.97 |