Partioned scheduling of tasks on automotive multicore ECUs

Aurélien Monot 1, 2 Nicolas Navet 1 Françoise Simonot-Lion 1 Bernard Bavoux 2
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : As the demand for computing power is quickly increasing in the automotive domain, car manufacturers and tier-one suppliers are gradually introducing multicore ECUs in their electronic architectures. In this paper we address the general problem of scheduling numerous elementary software components (called runnables) on a limited set of identical cores. In the context of an automotive design, we assume the use of the static task partitioning scheme which provides simplicity and better predictability for the ECU designers with respect to a global scheduling approach. We show how the global scheduling problem can be addressed as two sub-problems: partitioning the set of runnables and building the schedule on each core. Then, we prove that each of the sub-problems cannot be solved optimally due to their algorithmic complexity. We then present low complexity heuristics and derive lower bounds on their efficiency (i.e., competitive ratio). Finally, we assess the performance of our approach on realistic case-studies.
Type de document :
[Research Report] 2009
Liste complète des métadonnées
Contributeur : Nicolas Navet <>
Soumis le : lundi 28 décembre 2009 - 15:43:36
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05


  • HAL Id : inria-00443080, version 1



Aurélien Monot, Nicolas Navet, Françoise Simonot-Lion, Bernard Bavoux. Partioned scheduling of tasks on automotive multicore ECUs. [Research Report] 2009. 〈inria-00443080〉



Consultations de la notice