Scheduling malleable task trees

Abstract : Solving sparse linear systems can lead to processing tree workflows on a platform of processors. In this study, we use the model of malleable tasks motivated in [Prasanna96,Beaumont07] in order to study tree workflow schedules under two contradictory objectives: makespan minimization and memory minization. First, we give a simpler proof of the result of [Prasanna96] which allows to compute a makespan-optimal schedule for tree workflows. Then, we study a more realistic speed-up function and show that the previous schedules are not optimal in this context. Finally, we give complexity results concerning the objective of minimizing both makespan and memory.
Type de document :
Rapport
[Research Report] RR-8587, INRIA. 2014
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01059704
Contributeur : Equipe Roma <>
Soumis le : lundi 1 septembre 2014 - 16:17:59
Dernière modification le : vendredi 20 avril 2018 - 15:44:27
Document(s) archivé(s) le : mardi 2 décembre 2014 - 10:37:33

Fichier

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

Identifiants

  • HAL Id : hal-01059704, version 1

Collections

Citation

Loris Marchal, Frédéric Vivien, Bertrand Simon. Scheduling malleable task trees. [Research Report] RR-8587, INRIA. 2014. 〈hal-01059704〉

Partager

Métriques

Consultations de la notice

337

Téléchargements de fichiers

134