Global EDF scheduling of directed acyclic graphs on multiprocessor systems - Algorithmics Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Résumé

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

Dates et versions

hal-00878667 , version 1 (30-10-2013)

Identifiants

Citer

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, ⟨10.1145/2516821.2516836⟩. ⟨hal-00878667⟩
249 Consultations
934 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More