High Performance Complete and Incomplete Factorizations for Very Large Sparse Systems by using Scotch and PaStiX softwares
HÉNON, Pascal
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
PELLEGRINI, Francois
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
RAMET, Pierre
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Voir plus >
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
HÉNON, Pascal
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
PELLEGRINI, Francois
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
RAMET, Pierre
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
ROMAN, Jean
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
SAAD, Yousef
University of Minnesota [Twin Cities] [UMN]
Department of Computer Science and Engineering [Minneapolis]
< Réduire
University of Minnesota [Twin Cities] [UMN]
Department of Computer Science and Engineering [Minneapolis]
Langue
en
Communication dans un congrès
Ce document a été publié dans
Eleventh SIAM Conference on Parallel Processing for Scientific Computing, 2004, San Francisco. 2004
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Origine
Importé de halUnités de recherche