Steady-State for Batches of Identical Task Graphs

Abstract : 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.
Type de document :
Pré-publication, Document de travail
RRLIP2009-18. 2009
Liste complète des métadonnées

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

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00412953
Contributeur : Loris Marchal <>
Soumis le : mercredi 2 septembre 2009 - 17:28:51
Dernière modification le : jeudi 15 février 2018 - 08:48:03
Document(s) archivé(s) le : mardi 16 octobre 2012 - 10:11:16

Fichier

RR-europar.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : ensl-00412953, version 1

Citation

Sékou Diakité, Loris Marchal, Jean-Marc Nicod, Laurent Philippe. Steady-State for Batches of Identical Task Graphs. RRLIP2009-18. 2009. 〈ensl-00412953〉

Partager

Métriques

Consultations de la notice

231

Téléchargements de fichiers

99