Scheduling tree-shaped task graphs to minimize memory and makespan

Abstract : This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents a large IO file. A task can only be executed if all input and output files fit into memory, and a file can only be removed from memory after it has been consumed. Such trees arise, for instance, in the multifrontal method of sparse matrix factorization. The maximum amount of memory needed depends on the execution order of the tasks. With one processor the objective of the tree traversal is to minimize the required memory. This problem was well studied and optimal polynomial algorithms were proposed. Here, we extend the problem by considering multiple processors, which is of obvious interest in the application area of matrix factorization. With the multiple processors comes the additional objective to minimize the time needed to traverse the tree, i.e., to minimize the makespan. Not surprisingly, this problem proves to be much harder than the sequential one. We study the computational complexity of this problem and provide an inapproximability result even for unit weight trees. Several heuristics are proposed, each with a different optimization focus, and they are analyzed in an extensive experimental evaluation using realistic trees.
Type de document :
Communication dans un congrès
IPDPS 2013 - 27th IEEE International Parallel & Distributed Processing Symposium, May 2013, Boston, United States. 2013
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00788612
Contributeur : Equipe Roma <>
Soumis le : lundi 18 février 2013 - 14:36:05
Dernière modification le : vendredi 20 avril 2018 - 15:44:27
Document(s) archivé(s) le : dimanche 2 avril 2017 - 00:03:04

Fichier

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

Identifiants

  • HAL Id : hal-00788612, version 1

Collections

Citation

Loris Marchal, Oliver Sinnen, Frédéric Vivien. Scheduling tree-shaped task graphs to minimize memory and makespan. IPDPS 2013 - 27th IEEE International Parallel & Distributed Processing Symposium, May 2013, Boston, United States. 2013. 〈hal-00788612〉

Partager

Métriques

Consultations de la notice

213

Téléchargements de fichiers

99