Optimal reward-based scheduling for periodic real-time tasks (1999) [41 citations — 12 self]

Download:

by Hakan Aydin, Rami Melhem

IEEE Transactions on Computers

http://www.cs.pitt.edu/FORTS/papers/TOC00_aydin.ps.gz

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Aydin99optimalreward-based,
    author = {Hakan Aydin and Rami Melhem},
    title = {Optimal reward-based scheduling for periodic real-time tasks},
    booktitle = {IEEE Transactions on Computers},
    year = {1999},
    pages = {111--130},
    publisher = {IEEE Computer Society Press}
}

Years of Citing Articles

Abstract:

Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and an optional part. The mandatory part must complete before the task's deadline, while a non-decreasing reward function is associated with the execution of the optional part, which can be interrupted at any time. Imprecise computation and Increased-Reward-with-Increased-Service models fall within the scope of this framework. In this paper, we address the reward-based scheduling problem for periodic tasks. An optimal schedule is the one where mandatory parts complete in a timely manner and the weighted average reward is maximized. For linear and concave reward functions, which are most common, we (a) show the existence of an optimal schedule where the optional service time of a task is constant at every instance and (b) show how to efficiently compute this service time. We also prove the optimality of Rate Monotonic Scheduling (with harmonic periods), Earliest Deadline First and Least Laxity First policies for the case of uniprocessors when used with the optimal service times we computed. Moreover, we extend our result by showing that any policy which can fully utilize all the processors

Citations

2168	Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment – Liu, Layland - 1973
686	and Nonlinear Programming – Luenberger, Linear - 1984
293	Real-time heuristic search – Korf - 1990
211	Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment – Mok - 1993
210	Solving TimeDependent Planning Problems – Boddy, Dean - 1989
200	Algorithms for scheduling imprecise computations with timing constraints – Shih, Liu, et al. - 1989
112	Scheduling periodic jobs that allow imprecise results – Chung, Liu, et al. - 1990
107	Reasoning under varying and uncertain resource constraints – Horvitz - 1988
104	A Resource Allocation Model for QoS Management – Rajkumar, Lee, et al. - 1997
99	A dynamic priority assignment technique for streams with (m, k)-firm deadlines – Hamdaoui, Ramanathan - 1995
79	Imprecise results: utilizing partial computations in real-time systems – Lin, Natarajan, et al. - 1987
74	Skip-over: Algorithms and Complexity for Overloaded Real-Time Systems – Koren, Shasha - 1995
62	Architectural Foundations for Realtime Performance – Hayes-Roth - 1990
55	APPROXIMATE: a query processor that produces monotonically improving approximate answers – Vrbsky, Liu - 1993
50	Anytime sensing, planning and action: A practical model for robot control – Zilberstein, Russell - 1993
40	Image Transfer: An end-to-end design – Turner, Peterson - 1992
37	Scalable video data placement on parallel disk arrays – Chang, Zakhor - 1994
28	On-Line Scheduling Policies for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks – Dey, Kurose, et al. - 1996
25	Combining (n,m) Hard deadlines and Dual Priority scheduling – Bernat, Burns - 1997
25	Efficient on-line processor scheduling for a class of iris (increasing reward with increasing service.) real-time tasks – Dey, Kurose, et al. - 1993
18	Fairness in periodic real-time scheduling – Baruah - 1995
18	Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines – Feng, Liu - 1997
17	Scheduling Algorithms for Fault-Tolerance in Hard-Real Time – Bertossi, Mancini - 1994
17	Producing monotonically improving approximate answers to database queries – Vrbsky, Liu - 1995
15	Scalable Video Coding using 3-D Subband Velocity Coding and Multi-Rate Quantization – Chang, Zakhor - 1993
14	An extended imprecise computation model for time-constrained speech processing and generation – Feng, Liu - 1993
10	A value-driven system for autonomous information gathering – Grass, Zilberstein - 2000
6	Classical Optimization: Foundations and Extensions – Panik - 1976
4	A Polynomial-time Algorithm to solve Reward-Based Scheduling Problem – Aydn, Melhem, et al. - 1999
4	Real-time Systems. Mc Graw-Hill – Krishna, Shin - 1997

View or Download | Add to My Collection | Correct Errors