Skip to Main content Skip to Navigation
Conference papers

High Performance Complete and Incomplete Factorizations for Very Large Sparse Systems by using Scotch and PaStiX softwares

Pascal Hénon 1 Francois Pellegrini 1, 2 Pierre Ramet 1, 2 Jean Roman 1, 2 Yousef Saad 3, 4 
1 SCALAPPLIX - Algorithms and high performance computing for grand challenge applications
Université Bordeaux Segalen - Bordeaux 2, Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : PaStiX is a scientific library that provides a high performance direct supernodal solver for very large sparse linear systems. It relies on a block factorization based on an hybrid ordering (Nested Dissection + Halo Approximate Minimum Degree) obtained using the Scotch library. Efficient static scheduling and memory management are used to solve irregular problems with more of 25 millions unknowns on clusters of SMP nodes. In order to solve larger 3D problems, we apply these blockwise algorithms to compute robust and efficient parallel ILU preconditioners.
keyword : Sparse
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00346622
Contributor : Pierre Ramet Connect in order to contact the contributor
Submitted on : Thursday, December 11, 2008 - 8:38:35 PM
Last modification on : Saturday, June 25, 2022 - 10:31:17 AM

Identifiers

  • HAL Id : inria-00346622, version 1

Collections

Citation

Pascal Hénon, Francois Pellegrini, Pierre Ramet, Jean Roman, Yousef Saad. High Performance Complete and Incomplete Factorizations for Very Large Sparse Systems by using Scotch and PaStiX softwares. Eleventh SIAM Conference on Parallel Processing for Scientific Computing, 2004, San Francisco, United States. ⟨inria-00346622⟩

Share

Metrics

Record views

69