A heuristic to minimize the cardinality of a real-time task set by automated task clustering - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A heuristic to minimize the cardinality of a real-time task set by automated task clustering

Résumé

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.
Fichier principal
Vignette du fichier
bertoutSAC14.pdf (141.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01016182 , version 1 (28-06-2014)

Identifiants

Citer

Antoine Bertout, Julien Forget, Richard Olejnik. A heuristic to minimize the cardinality of a real-time task set by automated task clustering. Proceedings of the 29th Annual ACM Symposium on Applied Computing (SAC 2014), Apr 2014, Gyeongju, South Korea. ⟨10.1145/2554850.2554958⟩. ⟨hal-01016182⟩
197 Consultations
319 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More