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

1 IRIT-APO - Algorithmes Parallèles et Optimisation
IRIT - Institut de recherche en informatique de Toulouse
2 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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.
Keywords :
Document type :
Conference papers

https://hal.inria.fr/hal-01355356
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Tuesday, August 23, 2016 - 9:52:24 AM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM

### Identifiers

• HAL Id : hal-01355356, version 1

### Citation

Patrick 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⟩

Record views