Skip to Main content Skip to Navigation
New interface
Habilitation à diriger des recherches

Scalability of parallel sparse direct solvers: methods, memory and performance

Abstract : The fast and accurate solution of large size sparse systems of linear equations is at the heart of numerical applications from a very broad range of domains including structural mechanics, fluid dynamics, geophysics, medical imaging, chemistry. Among the most commonly used techniques, direct methods, based on the factorization of the system matrix, are generally appreciated for their numerical robustness and ease of use. These advantages, however, come at the price of a considerable operations count and memory footprint. The work presented in this thesis is concerned with improving the scalability of sparse direct solvers, intended as the ability to solve problems of larger and larger size. More precisely, our work aims at developing solvers which are scalable in performance, memory consumption and complexity. We address performance scalability, that is the ability to reduce the execution time as more computational resources are available, introducing algorithms that improve parallelism by reducing communications and synchronizations. We discuss the use of novel parallel programming paradigms and tools to achieve their implementation in an efficient and portable way on modern, heterogeneous supercomputers. We present methods that make sparse direct solvers memory-scalable, that is, capable of taking advantage of parallelism without increasing the overall memory footprint. Finally we show how it is possible to use data sparsity to achieve an asymptotic reduction of the cost of such methods. The presented algorithms have been implemented in the freely distributed MUMPS and qr_mumps solver packages and their effectiveness assessed on reallife problems from academic and industrial applications.
Complete list of metadata

Cited literature [225 references]  Display  Hide  Download
Contributor : Alfredo Buttari Connect in order to contact the contributor
Submitted on : Monday, November 5, 2018 - 9:21:41 PM
Last modification on : Monday, July 4, 2022 - 9:14:46 AM
Long-term archiving on: : Wednesday, February 6, 2019 - 3:52:41 PM


Files produced by the author(s)


  • HAL Id : tel-01913033, version 1


Alfredo Buttari. Scalability of parallel sparse direct solvers: methods, memory and performance. Distributed, Parallel, and Cluster Computing [cs.DC]. Toulouse INP, 2018. ⟨tel-01913033⟩



Record views


Files downloads