Algorithms for scheduling imprecise computations

The imprecise computation technique, which prevents timing faults and achieves graceful degradation by giving the user an approximate result of acceptable quality whenever the system cannot produce the exact result in time, is considered. Different approaches for scheduling imprecise computations in...

Full description

Saved in:
Bibliographic Details
Published in:Computer (Long Beach, Calif.) Calif.), 1991-05, Vol.24 (5), p.58-68
Main Authors: Liu, J.W.S., Lin, K.-J., Shih, W.-K., Yu, A.C.-s., Chung, J.-Y., Zhao, W.
Format: Article
Language:English
Subjects:
Computer languages
Heuristic algorithms
Image processing
Object oriented modeling
Processor scheduling
Programming profession
Real time systems
Scheduling algorithm
Time factors
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 imprecise computation technique, which prevents timing faults and achieves graceful degradation by giving the user an approximate result of acceptable quality whenever the system cannot produce the exact result in time, is considered. Different approaches for scheduling imprecise computations in hard real-time environments are discussed. Workload models that quantify the tradeoff between result quality and computation time are reviewed. Scheduling algorithms that exploit this tradeoff are described. These include algorithms for scheduling to minimize total error, scheduling periodic jobs, and scheduling parallelizable tasks. A queuing-theoretical formulation of the imprecise scheduling problem is presented.< >
ISSN:0018-9162
1558-0814
DOI:10.1109/2.76287