Sparse Supernodal Solver Using Hierarchical Compression over Runtime System

Abstract : In this talk, we present the PaStiX sparse supernodal solver, using hierarchical compression to reduce the burden on large blocks appearing during the nested dissection process. We compare the numerical stability, and the performance in terms of memory consumption and time to solution of different approaches by selecting when the compression of the factorized matrix occurs. In order to improve the efficiency of the sparse update kernel for both BLR (block low rank) and HODLR (hierarchically off-diagonal low-rank), we investigate the BDLR (boundary distance low-rank) method to preselect rows and columns in the low-rank approximation algorithm.
Type de document :
Communication dans un congrès
SIAM Conference on Computation Science and Engineering (CSE'17), Feb 2017, Atlanta, United States. 〈http://www.siam.org/meetings/cse17/〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01421379
Contributeur : Pierre Ramet <>
Soumis le : jeudi 22 décembre 2016 - 10:35:09
Dernière modification le : mercredi 11 juillet 2018 - 14:44:01

Identifiants

  • HAL Id : hal-01421379, version 1

Citation

Grégoire Pichon, Eric Darve, Mathieu Faverge, Pierre Ramet, Jean Roman. Sparse Supernodal Solver Using Hierarchical Compression over Runtime System. SIAM Conference on Computation Science and Engineering (CSE'17), Feb 2017, Atlanta, United States. 〈http://www.siam.org/meetings/cse17/〉. 〈hal-01421379〉

Partager

Métriques

Consultations de la notice

353