Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Reward-Based Scheduling of Periodic Real-Time Tasks Hakan Aydin, Rami Melhem, and Daniel Mosse Pedro Mejia-Alvarez y
 

Summary: Optimal Reward-Based Scheduling of Periodic Real-Time Tasks
Hakan Aydin, Rami Melhem, and Daniel Moss´e Pedro Mej´ia-Alvarez y
Computer Science Department CINVESTAV-IPN. Secci´on de Computaci´on
University of Pittsburgh Av. I.P.N. 2508, Zacatenco.
Pittsburgh, PA 15260 M´exico, DF. 07300
faydin,mosse,melhemg@cs.pitt.edu pmejia@cs.pitt.edu
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 manda-
tory and an optional part, with which a nondecreasing reward
function is associated. 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. For linear and con-
cave reward functions we show: (a) the existence of an optimal
schedule where the optional service time of a task is constant
at every instance and (b) how to efficiently compute this service
time. We also prove that RMS-h (RMS with harmonic periods),
EDF and LLF policies are optimal when used with the opti-

  

Source: Aydin, Hakan - Department of Computer Science, George Mason University

 

Collections: Computer Technologies and Information Sciences; Engineering