Efficient algorithms for direct resolution of large sparse system on clusters of SMP nodes

Pascal Hénon 1 Pierre Ramet 1, 2 Jean Roman 1, 2
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 : In previous works, we have described an efficient static scheduling based on a mixed 1D/2D block distribution with local aggregation for a parallel supernodal version of sparse $LL^T$ factorization. In this paper, we present new algorithms suitable for overcoming architectures based on clusters of SMP nodes and also technics to keep a good memory scalability. This algorithms are implemented in the PaStiX library that achieved high performances (resolution of a $26.10^6$ unknown system on 192 ES45 quadriprocessors with 35 percent of peak performance).
keyword : Sparse
Type de document :
Communication dans un congrès
SIAM Conference on Applied Linear Algebra, 2003, Williamsburg, United States. 2003
Liste complète des métadonnées

https://hal.inria.fr/inria-00346609
Contributeur : Pierre Ramet <>
Soumis le : jeudi 11 décembre 2008 - 19:22:52
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12

Identifiants

  • HAL Id : inria-00346609, version 1

Collections

Citation

Pascal Hénon, Pierre Ramet, Jean Roman. Efficient algorithms for direct resolution of large sparse system on clusters of SMP nodes. SIAM Conference on Applied Linear Algebra, 2003, Williamsburg, United States. 2003. 〈inria-00346609〉

Partager

Métriques

Consultations de la notice

91