From hybrid architectures to hybrid solvers

Pierre Ramet 1, 2
Abstract : Solving large sparse systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. Consequently, many parallel techniques for sparse matrix solution have been studied, designed and implemented based on factorization or hybrid iterative-direct approaches. In this context, graph partitioning and nested dissection ideas have played a crucial role. The main goal of this presentation will be to give an overview of the continuum between these various algorithmic approaches and to present the improvements of the algorithms and of the associated parallel implementations in a manycore context. Numerical experiments on large irregular real-life problems will illustrate this work.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-00924979
Contributor : Pierre Ramet <>
Submitted on : Tuesday, January 7, 2014 - 1:29:32 PM
Last modification on : Thursday, January 11, 2018 - 6:22:35 AM
Long-term archiving on : Monday, April 7, 2014 - 11:26:13 PM

File

abstract2_HiePACS.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00924979, version 1

Citation

Pierre Ramet. From hybrid architectures to hybrid solvers. Workshop Celebrating 40 Years of Nested Dissection, Jul 2013, Waterloo, Canada. ⟨hal-00924979⟩

Share

Metrics

Record views

241

Files downloads

243