Algorithms for scheduling imprecise computations
J.W.S. Liu, Kuo-Yi Lin, W.-K. Shih et al. · Computer · 1991
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.>
Cited by 525 works. doi:10.1109/2.76287
Authors
References
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- A new polynomial-time algorithm for linear programming
- Scheduling with Deadlines and Loss Functions
- Sequencing and scheduling : algorithms and complexity
- Scheduling periodic jobs that allow imprecise results
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Expressing and maintaining timing constraints in FLEX
- Computing and Information:
- Minimizing mean flow time with error constraint
- An object-oriented query processor that produces monotonically improving approximate answers