Schedulability Analysis for Directed Acyclic Graphs on Multiprocessor Systems at a Subtask Level

Abstract : This paper addresses the problem of scheduling parallel real- time tasks of Directed Acyclic Graph (DAG) model on multiprocessor systems. We propose a new scheduling method based on a subtask-level, which means that the schedulability decisions are taken based on the local temporal parameters of subtasks. This method requires modifying the subtasks to add more parameters which are necessary for the analysis, such as local offsets, deadlines and release jitters. Then we provide interference and workload analyses of DAG tasks, and we provide a schedulability test for any work conserving scheduling algorithm.
Type de document :
Communication dans un congrès
19th International Conference on Reliable Software Technologies ADA-Europe, Jun 2014, Paris, France. volume 8454, pp.N/A, 2014
Liste complète des métadonnées

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

https://hal-upec-upem.archives-ouvertes.fr/hal-01021856
Contributeur : Manar Qamhieh <>
Soumis le : mercredi 9 juillet 2014 - 17:19:58
Dernière modification le : mercredi 4 juillet 2018 - 16:38:03
Document(s) archivé(s) le : jeudi 9 octobre 2014 - 12:47:45

Fichier

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

Identifiants

  • HAL Id : hal-01021856, version 1

Citation

Manar Qamhieh, Serge Midonnet. Schedulability Analysis for Directed Acyclic Graphs on Multiprocessor Systems at a Subtask Level. 19th International Conference on Reliable Software Technologies ADA-Europe, Jun 2014, Paris, France. volume 8454, pp.N/A, 2014. 〈hal-01021856〉

Partager

Métriques

Consultations de la notice

337

Téléchargements de fichiers

238