Scheduling periodic jobs that allow imprecise results

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1990-09, Vol.39 (9), p.1156-1174
Main Authors: Chung, J.-Y., Liu, J.W.S., Lin, K.-J.
Format: Article
Language:English
Subjects:
Applied sciences
Computational modeling
Computer Programming And Software
Computer science
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
NASA
Process design
Processor scheduling
Programming environments
Programming profession
Real time systems
Scheduling algorithm
Software
Timing
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: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.< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.57057