Automated runnable to task mapping

Antoine Bertout 1, 2, 3, * Julien Forget 1, 2, 3 Richard Olejnik 1, 2, 3
* Corresponding author
1 DART - Contributions of the Data parallelism to real time
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
2 LIFL - DART/Émeraude
LIFL - Laboratoire d'Informatique Fondamentale de Lille
Abstract : We propose in this paper, a method to automatically map runnables (blocks of code with dedicated functionality) with real-time constraints to tasks (or threads). We aim at reducing the number of tasks runnables are mapped to, while preserving the schedulability of the initial system. We consider independent tasks running on a single processor. Our approach has been applied with fixed-task or fixed-job priorities assigned in a Deadline Monotonic (DM) or a Earliest Deadline First (EDF) manner.
Document type :
Liste complète des métadonnées

Cited literature [23 references]  Display  Hide  Download
Contributor : Antoine Bertout <>
Submitted on : Tuesday, June 11, 2013 - 2:30:38 PM
Last modification on : Thursday, February 21, 2019 - 10:52:54 AM
Document(s) archivé(s) le : Tuesday, April 4, 2017 - 6:49:56 PM


Files produced by the author(s)


  • HAL Id : hal-00827798, version 2


Antoine Bertout, Julien Forget, Richard Olejnik. Automated runnable to task mapping. 2013. ⟨hal-00827798v2⟩



Record views


Files downloads