In this paper, we consider a set of real-time periodic tasks where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (AMP) while still meeting their deadlines. After introduc...
详细信息
In this paper, we consider a set of real-time periodic tasks where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (AMP) while still meeting their deadlines. After introducing the idea of preference-oriented (PO) execution, we formally define the concept of PO-optimality. For fully-loaded systems (with 100% utilization), we first propose a PO-optimal scheduler, namely ASAP-Ensured Earliest Deadline (SEED), by focusing on ASAP tasks where the optimality of ALAP tasks' preference is achieved implicitly due to the harmonicity of the PO-optimal schedules for such systems. Then, for under-utilized systems (with less than 100% utilization), we show the discrepancies between different PO-optimal schedules. By extending SEED, we propose a generalized preference-oriented Earliest Deadline (POED) scheduler that can obtain a PO-optimal schedule for any schedulable task set. The application of the POED scheduler in a dual-processor fault-tolerant system is further illustrated. We evaluate the proposed PO-optimal schedulers through extensive simulations. The results show that, comparing to that of the well-known EDF scheduler, the scheduling overheads of SEED and POED are higher (but still manageable) due to the additional consideration of tasks' preferences. However, SEED and POED can achieve the preference-oriented execution objectives in a more successful way than EDF. (C) 2014 Elsevier B.V. All rights reserved.
Most real-time scheduling algorithms prioritize tasks solely based on their timing parameters and cannot effectively handle them when they have different executionpreferences. In this paper, for a set of periodic tas...
详细信息
ISBN:
(纸本)9781479950799
Most real-time scheduling algorithms prioritize tasks solely based on their timing parameters and cannot effectively handle them when they have different executionpreferences. In this paper, for a set of periodic tasks, where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (ALAP), we investigate preference-oriented fixedpriority scheduling algorithms. Specifically, following the idea in dual-priority scheduling, we derive promotion times for ALAP tasks (only). Then, we devise a dual-queue based fixed-priority scheduling algorithm that retains ALAP tasks in the waiting queue until their promotion times to delay their executions while putting ASAP tasks into the ready queue immediately once they arrive for early execution. We also investigate online techniques to further expedite (delay) the executions of ASAP (ALAP) tasks, respectively. Our evaluation results show that the dual-queue technique with ALAP tasks' promotion times can effectively address the executionpreferences of both ASAP and ALAP tasks, which can be further improved at runtime with wrapper-task based slack management. Our technique is shown to yield clear advantages over a simple technique that periodically inserts idle intervals to the schedule before ALAP tasks are executed.
暂无评论