Task Scheduling for Parallel Multifrontal Methods

Olivier Beaumont 1 Abdou Guermouche 1, 2
2 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
INRIA Futurs, Université Bordeaux Segalen - Bordeaux 2, Université Sciences et Technologies - Bordeaux 1, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : We present a new scheduling algorithm for task graphs arising from parallel multifrontal methods for sparse linear systems. This algorithm is based on the theorem proved by Prasanna and Musicus [1] for tree-shaped task graphs, when all tasks exhibit the same degree of parallelism. We propose extended versions of this algorithm to take communication between tasks and memory balancing into account. The efficiency of proposed approach is assessed by a set of experiments on a set of large sparse matrices from several libraries.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00358626
Contributor : Abdou Guermouche <>
Submitted on : Wednesday, February 4, 2009 - 3:28:24 AM
Last modification on : Thursday, January 11, 2018 - 6:20:16 AM

Identifiers

  • HAL Id : hal-00358626, version 1

Collections

Citation

Olivier Beaumont, Abdou Guermouche. Task Scheduling for Parallel Multifrontal Methods. Euro-Par 2007 Parallel Processing, 2007, France. pp.758-766. ⟨hal-00358626⟩

Share

Metrics

Record views

248