Automated runnable to task mapping

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.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00827798
Author Bertout, Antoine, Forget, Julien, Olejnik, Richard
Maintainer CCSD
Last Updated May 10, 2026, 19:33 (UTC)
Created May 10, 2026, 19:33 (UTC)
Identifier hal-00827798
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Contributions of the Data parallelism to real time (DART) ; Laboratoire d'Informatique Fondamentale de Lille (LIFL) ; Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de l'Université de Lille ; Institut National de Recherche en Informatique et en Automatique (Inria)
creator Bertout, Antoine
date 2013-05-29T00:00:00
harvest_object_id 6364f106-03fa-4524-97a3-52df9c75fa48
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-02-26T00:00:00
set_spec type:REPORT