Home // International Journal On Advances in Systems and Measurements, volume 6, numbers 3 and 4, 2013 // View article

Sustainable Multiprocessor Real-Time Scheduling with Exact Preemption Cost

Authors:
Falou Ndoye
Yves Sorel

Keywords: multiprocessor real-time scheduling; partitioned scheduling; exact preemption cost; sustainable; load balancing.

Abstract:
In this paper, we address for safety critical ap- plications the problem of multiprocessor real-time scheduling while taking into account the exact preemption cost. In the framework of multiprocessor real-time partitioned scheduling, we propose a greedy heuristic, which balances the load of the tasks on all the processors and minimizes the response time of the applications. That heuristic uses a schedulability condition, which is based on the ⊕ operation. That operation performs a schedulability analysis while taking into account the exact preemption cost. In this paper, the WCETs (Worst Case Execution Time) of tasks are considered rather than its EETs (Exact Execution Time). In this case, we prove that the schedulability analysis is sustainable. We also highlight the impact of the preemption cost in the schedulability analysis. A performance analysis is achieved, which compares the proposed heuristic to a branch and bound exact algorithm and to worst- fit and best-fit heuristics.

Pages: 353 to 363

Copyright: Copyright (c) to authors, 2013. Used with permission.

Publication date: December 31, 2013

Published in: journal

ISSN: 1942-261x