Modeling 1D distributed-memory dense kernels for an asynchronous multifrontal sparse solver - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

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.
No file

Dates and versions

hal-01355356 , version 1 (23-08-2016)

Identifiers

  • HAL Id : hal-01355356 , version 1

Cite

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, {VECPAR} 2014 - 11th International Conference, Revised Selected Papers, Jun 2014, Eugene, Oregon, United States. pp.156-169. ⟨hal-01355356⟩
317 View
0 Download

Share

Gmail Facebook X LinkedIn More