A heuristic to minimize the cardinality ...
Type de document :
Communication dans un congrès avec actes
DOI :
Titre :
A heuristic to minimize the cardinality of a real-time task set by automated task clustering
Auteur(s) :
Bertout, Antoine [Auteur]
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]
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]
Titre de la manifestation scientifique :
Proceedings of the 29th Annual ACM Symposium on Applied Computing (SAC 2014)
Ville :
Gyeongju
Pays :
Corée du Sud
Date de début de la manifestation scientifique :
2014-04-24
Date de publication :
2014-04-24
Mot(s)-clé(s) en anglais :
real-time
scheduling
task clustering
functionality to task mapping
scheduling
task clustering
functionality to task mapping
Discipline(s) HAL :
Informatique [cs]/Systèmes embarqués
Résumé en anglais : [en]
We propose in this paper a method to automatically map functionalities (blocks of code corresponding to high-level features) with real-time constraints to tasks (or threads). We aim at reducing the number of tasks functions ...
Lire la suite >We propose in this paper a method to automatically map functionalities (blocks of code corresponding to high-level features) with real-time constraints to tasks (or threads). We aim at reducing the number of tasks functions 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.Lire moins >
Lire la suite >We propose in this paper a method to automatically map functionalities (blocks of code corresponding to high-level features) with real-time constraints to tasks (or threads). We aim at reducing the number of tasks functions 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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01016182/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01016182/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- bertoutSAC14.pdf
- Accès libre
- Accéder au document
- bertoutSAC14.pdf
- Accès libre
- Accéder au document