Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1137/130938505 | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | DocType | Volume |
sparse matrix algorithms,direct methods,task scheduling | Journal | 38 |
Issue | ISSN | Citations |
3 | 1064-8275 | 3 |
PageRank | References | Authors |
0.40 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emmanuel Agullo | 1 | 217 | 21.56 |
| Patrick R. Amestoy | 2 | 446 | 44.24 |
| Alfredo Buttari | 3 | 647 | 53.60 |
| Abdou Guermouche | 4 | 269 | 27.32 |
| Jean-Yves L'Excellent | 5 | 348 | 36.02 |
| François-Henry Rouet | 6 | 71 | 6.35 |