A Preliminary Out-of-Core Extension of a Parallel Multifrontal Solver

Emmanuel Agullo 1 Jean-Yves L'Excellent 1 Abdou Guermouche 2, 3
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 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 : The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems. This paper describes a first implementation of an out-of-core extension to a parallel multifrontal solver (MUMPS). We show that larger problems can be solved on limited-memory machines with reasonable performance, and we illustrate the behaviour of our parallel out-of-core factorization. Then we use simulations to discuss how our algorithms can be modified to solve much larger problems.
Complete list of metadatas

Contributor : Abdou Guermouche <>
Submitted on : Wednesday, February 4, 2009 - 3:21:38 AM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM


  • HAL Id : hal-00358624, version 1


Emmanuel Agullo, Jean-Yves L'Excellent, Abdou Guermouche. A Preliminary Out-of-Core Extension of a Parallel Multifrontal Solver. Euro-Par 2006 Parallel Processing, 2006, Germany. pp.1053-1063. ⟨hal-00358624⟩



Record views