Skip to Main content Skip to Navigation
Journal articles

Robust memory-aware mappings for parallel multifrontal factorizations

Abstract : We study the memory scalability of the parallel multifrontal factorization of sparse matrices. In particular, we are interested in controlling the active memory specific to the multifrontal factorization. We illustrate why commonly used mapping strategies (e.g., the proportional mapping) cannot provide a high memory efficiency, which means that they tend to let the memory usage of the factorization grow when the number of processes increases. We propose " memory-aware " algorithms that aim at maximizing the granularity of parallelism while respecting memory constraints. These algorithms provide accurate memory estimates prior to the factorization and can significantly enhance the robustness of a multifrontal code. We illustrate our approach with experiments performed on large matrices. 1. Introduction. We consider the memory scalability of sparse direct methods for the solution of linear systems on distributed-memory architectures. We focus on the multifrontal method [6, 7]. In this method, the consumed memory space consists of the factors to be computed (e.g., the L U factors of a given matrix A) and some temporary data that we call the active memory and that we describe in detail in the next section. Both the size of the factors and of the active memory depend on the input matrix permutation [12] (nested dissection methods are commonly used on large size problems); in this work we focus on studying the memory consumption resulting from different mapping techniques for a fixed matrix permutation. The active memory can represent a significant fraction of the total memory, and, as we will show in Section 2, it does not naturally scale when the number of processes increases. This means that the total memory usage of the factorization can dangerously grow with the number of processes. This highlights the need for mapping and scheduling algorithms that are able to control the active memory. In Section 3, we suggest memory-aware mapping algorithms that aim at maximizing the granularity of parallelism under a given memory constraint (the maximum memory usage of a process). We illustrate our approach in Section 4 with experiments carried out on large matrices using up to 256 processes. Although we focus on the multifrontal method, our study can be applied to any application with a tree-shaped workflow graph since, as we recall in the next subsection , the multifrontal method relies on the so-called elimination tree [24]. A similar problem has also been recently explored from a more theoretical point of view [8].
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download
Contributor : Abdou Guermouche <>
Submitted on : Wednesday, July 27, 2016 - 10:08:36 AM
Last modification on : Wednesday, October 14, 2020 - 9:34:02 AM


Files produced by the author(s)


  • HAL Id : hal-01334113, version 2


Emmanuel Agullo, Patrick Amestoy, Alfredo Buttari, Abdou Guermouche, Jean-Yves l'Excellent, et al.. Robust memory-aware mappings for parallel multifrontal factorizations. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2016, 38 (3), pp.23. ⟨hal-01334113v2⟩



Record views


Files downloads