Automated runnable to task mapping

Bertout, Antoine; Forget, Julien; Olejnik, Richard

Document type :

Rapport de recherche

Title :

Automated runnable to task mapping

Author(s) :

Bertout, Antoine [Auteur correspondant]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
LIFL - DART/Émeraude
Contributions of the Data parallelism to real time [DART]
Forget, Julien [Auteur]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
LIFL - DART/Émeraude
Contributions of the Data parallelism to real time [DART]
Olejnik, Richard [Auteur]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
LIFL - DART/Émeraude
Contributions of the Data parallelism to real time [DART]

English keyword(s) :

real-time
scheduling
task clustering
runnable-to-task
mapping

HAL domain(s) :

Informatique [cs]/Systèmes embarqués

English abstract : [en]

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 ...
Show more >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.Show less >

Language :

Anglais

Collections :