Constructing Memory-minimizing Schedules for Multifrontal Methods

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 : We are interested in the active and total memory usage of the multifrontal method. Starting from the algorithms proposed by Liu, we suggest a new scheme together with a tree traversal that give an optimal peak of active memory. Significant gains are obtained compared to Liu's approach. We also study the problem of minimizing the total memory and compare various new schemes. A number of experiments shows the interest of these approaches.
Complete list of metadatas
Contributor : Abdou Guermouche <>
Submitted on : Wednesday, February 4, 2009 - 2:55:58 AM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM


  • HAL Id : hal-00358620, version 1


Jean-Yves L'Excellent, Abdou Guermouche. Constructing Memory-minimizing Schedules for Multifrontal Methods. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2006, 32 (1), pp.17-32. ⟨hal-00358620⟩



Record views