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
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 UMN - University of Minnesota [Twin Cities]
4 Department of Computer Science and Engineering [Minneapolis]

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.

Mots clés: Sparse

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⟩