Skip to Main content Skip to Navigation
Conference papers

Modeling 1D distributed-memory dense kernels for an asynchronous multifrontal sparse solver

Abstract : To solve sparse systems of linear equations, multifrontal methods rely on dense partial LU decompositions of so-called frontal matrices; we consider a parallel asynchronous setting in which several frontal matrices can be factored simultaneously.In this context, to address performance and scalability issues of acyclic pipelined asynchronous factorization kernels, we study models to revisit properties of left and right-looking variants of partial \(LU\) decompositions, study the use of several levels of blocking, before focusing on communication issues.The general purpose sparse solver MUMPS has been modified to implement the proposed algorithms and confirm the properties demonstrated by the models.
Complete list of metadatas

https://hal.inria.fr/hal-01355356
Contributor : Equipe Roma <>
Submitted on : Tuesday, August 23, 2016 - 9:52:24 AM
Last modification on : Friday, June 12, 2020 - 3:52:47 AM

Identifiers

  • HAL Id : hal-01355356, version 1

Citation

Patrick R. Amestoy, Jean-Yves l'Excellent, François-Henry Rouet, Wissam M. Sid-Lakhdar. Modeling 1D distributed-memory dense kernels for an asynchronous multifrontal sparse solver. High Performance Computing for Computational Science, 2014 - 11th International Conference, Revised Selected Papers, Jun 2014, Eugene, Oregon, United States. pp.156-169. ⟨hal-01355356⟩

Share

Metrics

Record views

517