Better late than never

Authors:
Hossein Moiin;P. M. Melliar-Smith;Louise Moser
Affiliations:
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 7
Cited 0

A fault-tolerant scheduling problem

IEEE Transactions on Software Engineering
Scheduling real-time transactions

ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
Algorithms for scheduling imprecise computations with timing constraints

SIAM Journal on Computing
Real-time scheduling algorithms

Real-time scheduling algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Best-effort decision-making for real-time scheduling

Best-effort decision-making for real-time scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the trade-off between timeliness and precision of real-time tasks. For a task that must satisfy real-time requirements and that is capable of generating intermediate results of lower precision, an overall value function is defined as the product of its timeliness and precision. The problem of finding an optimal schedule for a set of tasks with such overall value functions is decomposed into two related subproblems of ordering and optimization. Optimal and heuristic solutions for each subproblem as well as the overall scheduling problem are presented.