L'EXCELLENT, Jean-Yves; AMESTOY, Patrick; PRALET, Stéphane; GUERMOUCHE, Abdou

doi:10.1016/j.parco.2005.07.004

Métadonnées

Licence d’utilisation du document

L'EXCELLENT, Jean-Yves
Algorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL]

AMESTOY, Patrick
Algorithmes Parallèles et Optimisation [IRIT-APO]
Institut National Polytechnique (Toulouse) [Toulouse INP]

PRALET, Stéphane
Algorithmes Parallèles et Optimisation [IRIT-APO]
Institut National Polytechnique (Toulouse) [Toulouse INP]

Langue

Article de revue

Ce document a été publié dans

Parallel Computing. 2006, vol. 32, n° 2, p. 136-156

Elsevier

Résumé en anglais

We consider the problem of designing a dynamic scheduling strategy that takes into account both workload and memory information in the context of the parallel multifrontal factorization. The originality of our approach is that we base our estimations (work and memory) on a static optimistic scenario during the analysis phase. This scenario is then used during the factorization phase to constrain the dynamic decisions that compute fully irregular partitions in order to better balance the workload. We show that our new scheduling algorithm significantly improves both the memory behaviour and the factorization time. We give experimental results for large challenging real-life 3D problems on 64 and 128 processors.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Hybrid scheduling for the parallel solution of linear systems

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche