Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Abstract : In this paper, we study the problem of real-time scheduling of parallel tasks represented by a Directed Acyclic Graph (DAG) on multiprocessor architectures. We focus on Global Earliest Deadline First scheduling of sporadic DAG tasksets with constrained-deadlines on a system of homogeneous processors. Our contributions consist in analyzing DAG tasks by considering their internal structures and providing a tighter bound on the workload and interference analysis. This approach consists in assigning a local offset and deadline for each subtask in the DAG. We derive an improved sufficient schedulability test w.r.t. an existing test proposed in the state of the art. Then we discuss the sustainability of this test.
Type de document :
Communication dans un congrès
Proceedings of the 21st International conference on Real-Time Networks and Systems, Oct 2013, Sophia Antipolis, France. pp.287-297, 2013, 〈10.1145/2516821.2516836〉
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00878667
Contributeur : Manar Qamhieh <>
Soumis le : mercredi 30 octobre 2013 - 14:56:45
Dernière modification le : mardi 22 mai 2018 - 12:48:02
Document(s) archivé(s) le : vendredi 7 avril 2017 - 19:23:09

Fichier

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

Identifiants

Citation

Manar Qamhieh, Frédéric Fauberteau, Laurent George, Serge Midonnet. Global EDF scheduling of directed acyclic graphs on multiprocessor systems. Proceedings of the 21st International conference on Real-Time Networks and Systems, Oct 2013, Sophia Antipolis, France. pp.287-297, 2013, 〈10.1145/2516821.2516836〉. 〈hal-00878667〉

Partager

Métriques

Consultations de la notice

380

Téléchargements de fichiers

586