On the I/O Volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme

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 : Sparse direct solvers, and in particular multifrontal methods, are widely used in various simulation problems. Because of their large memory requirements, the use of out-of-core solvers is compulsory for large-scale problems, where disks are used to extend the core memory. This study is at the junction of two previous independent works: it extends the problem of the minimization of the volume of I/O [4] in the multifrontal method to the more general flexible parent allocation algorithm [8]. We explain how to compute the I/O volume with respect to this scheme and propose an efficient greedy heuristic which significantly reduces the I/O volume on real-life problems in this new context.
Complete list of metadatas

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


  • HAL Id : hal-00358627, version 1


Emmanuel Agullo, Jean-Yves L'Excellent, Abdou Guermouche. On the I/O Volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme. High Performance Computing for Computational Science - VECPAR 2008, 2008, France. pp.328-335. ⟨hal-00358627⟩



Record views