Scheduling periodic jobs that allow imprecise results
Authors:
- 1 September 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 39 (9) , 1156-1174
Abstract
The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Timing faults are avoided in such systems by making available intermediate, imprecise results of acceptable quality when results of the desired quality cannot be produced on time. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result.<>Keywords
This publication has 16 references indexed in Scilit:
- A fault-tolerant scheduling problemIEEE Transactions on Software Engineering, 1986
- New directions in scheduling theoryOperations Research Letters, 1984
- On Programming by IterationsIEEE Transactions on Software Engineering, 1984
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling periodically occurring tasks on multiple processorsInformation Processing Letters, 1981
- A note on preemptive scheduling of periodic, real-time tasksInformation Processing Letters, 1980
- On Development of Iterative Programs from Function SpecificationsIEEE Transactions on Software Engineering, 1980
- On a Real-Time Scheduling ProblemOperations Research, 1978
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Applied Dynamic Programming1962