Minimizing the cardinality of a real-time task set by automated task clustering

Antoine Bertout 1, 2, 3 Julien Forget 1, 2, 3 Richard Olejnik 1, 2, 3
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 : The objective of this paper is first to properly define the notion of task clustering. This is the process of automatically mapping functionalities (blocks of code corresponding to a high-level feature) with real-time constraints to tasks (or threads). We aim at reducing the number of tasks functionalities are mapped to, while preserving the schedulability of the initial system. Second, our goal is to expose the complexity of the problem and to sketch methods we will propose for solving this problem. We consider independent tasks running on a single processor.
Type de document :
Communication dans un congrès
Proceedings of the 7th Junior Researcher Workshop on Real-Time Computing (JRWRTC 2013), Oct 2013, Sophia Antipolis, France. pp.9-12, 2013
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00874979
Contributeur : Antoine Bertout <>
Soumis le : dimanche 20 octobre 2013 - 15:04:43
Dernière modification le : jeudi 11 janvier 2018 - 06:24:24
Document(s) archivé(s) le : vendredi 7 avril 2017 - 13:30:46

Fichier

jrwrtc2013_paper_3.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00874979, version 1

Citation

Antoine Bertout, Julien Forget, Richard Olejnik. Minimizing the cardinality of a real-time task set by automated task clustering. Proceedings of the 7th Junior Researcher Workshop on Real-Time Computing (JRWRTC 2013), Oct 2013, Sophia Antipolis, France. pp.9-12, 2013. 〈hal-00874979〉

Partager

Métriques

Consultations de la notice

517

Téléchargements de fichiers

217