Implementation study of the Parallel Sparse LU Factorization

Michel Cosnard 1 Laura Grigori 1
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper describes an efficient parallel implementation of our previously published LU factorization method for sparse matrices. The main achievement is the usage of a message-passing paradigm instead of the already implemented shared-memory solver. A necessary presentation of the theoretical context is included first, then we briefly show the symbolic factorization steps (build LU elimination forest, postorder traversal, supernode identification) and the numerical factorization steps (Factor and Update steps and algorithm). The experiments were run on an SGI Origin2000 multiprocessor with 64 nodes.
Type de document :
Communication dans un congrès
International Conference on Parallel & Distributed Computing and Systems - PDCS'2000, Nov 2000, none, 6 p, 2000
Liste complète des métadonnées

https://hal.inria.fr/inria-00099237
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:52:04
Dernière modification le : jeudi 11 janvier 2018 - 06:20:00

Identifiants

  • HAL Id : inria-00099237, version 1

Collections

Citation

Michel Cosnard, Laura Grigori. Implementation study of the Parallel Sparse LU Factorization. International Conference on Parallel & Distributed Computing and Systems - PDCS'2000, Nov 2000, none, 6 p, 2000. 〈inria-00099237〉

Partager

Métriques

Consultations de la notice

96