Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures

Abstract : Matrices coming from elliptic Partial Differential Equations have been shown to have a low-rank property which can be efficiently exploited in multifrontal solvers to provide a substantial reduction of their complexity. Among the possible low-rank formats, the Block Low-Rank format (BLR) is easy to use in a general purpose multifrontal solver and its potential compared to standard (full-rank) solvers has been demonstrated. Recently, new variants have been introduced and it was proved that they can further reduce the complexity but their performance has never been analyzed. In this paper, we present a multithreaded BLR factorization, and analyze its efficiency and scalability in shared-memory multicore environments. We identify the challenges posed by the use of BLR approximations in multifrontal solvers and put forward several algorithmic variants of the BLR factorization that overcome these challenges by improving its efficiency and scalability. We illustrate the performance analysis of the BLR multifrontal factorization with numerical experiments on a large set of problems coming from a variety of real-life applications.
Document type :
Reports
Liste complète des métadonnées

Cited literature [38 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01505070
Contributor : Theo Mary <>
Submitted on : Tuesday, April 11, 2017 - 12:56:16 AM
Last modification on : Friday, April 12, 2019 - 4:23:34 PM
Document(s) archivé(s) le : Wednesday, July 12, 2017 - 12:34:01 PM

File

HAL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01505070, version 1

Citation

Patrick Amestoy, Alfredo Buttari, Jean-Yves L'Excellent, Théo Mary. Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures. [Research Report] INPT-IRIT; CNRS-IRIT; INRIA-LIP; UPS-IRIT. 2017. ⟨hal-01505070⟩

Share

Metrics

Record views

828

Files downloads

466