Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements

—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provided arbitrary service times before their deadlines, and obtains rewards based on the service times received by the jobs of the task. We show that this model is compatible with the imprecise computation models and the increasing reward with increasing service models. In contrast to previous work on these models, which mainly focus on maximizing the total reward in the system, we additionally aim to fulfill different reward requirements by different tasks. This provides better fairness and also allows fine-grained tradeoff between tasks. We first derive a necessary and sufficient condition for a system with reward requirements of tasks to be feasible. We next obtain an off-line feasibility optimal scheduling policy. We then study a sufficient condition for a policy to be feasibility optimal or achieve some...

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: I-Hong Hou, P. R. Kumar
• Keywords: CORR 2010, Education, Periodic Real-time Tasks, Policy, Reward Requirements