Steady-State for Batches of Identical Task Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Steady-State for Batches of Identical Task Graphs

Résumé

In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on steady-state scheduling, and aim at reaching the optimal throughput of the system. Contrarily to previous studies, we concentrate upon the scheduling of batches of limited size. We try to reduce the processing time of each instance, thus making steady-state scheduling applicable to smaller batches. The problem is proven NP-complete, and a mixed integer program is presented to solve it. Then, different solutions, using steady-state scheduling or not, are evaluated through comprehensive simulations.
Fichier principal
Vignette du fichier
dmnp09_ip.pdf (112.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00563303 , version 1 (04-02-2011)

Identifiants

  • HAL Id : hal-00563303 , version 1

Citer

Sékou Diakité, Loris Marchal, Jean-Marc Nicod, Laurent Philippe. Steady-State for Batches of Identical Task Graphs. Euro-Par'09, 2009, Netherlands. pp.203--215. ⟨hal-00563303⟩
136 Consultations
90 Téléchargements

Partager

Gmail Facebook X LinkedIn More