PaStiX: A Parallel Direct Solver for Sparse SPD Matrices based on Efficient Static Scheduling and Memory Managment

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 : Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. In this work, we consider the block partitioning and scheduling problem for sparse parallel factorization without pivoting. We focus on the scalability of the parallel solver, and on the compromise between memory overhead and efficiency. We validate this study with parallel experiments on a large collection of irregular industrial problems.
keyword : Sparse
Type de document :
Communication dans un congrès
Tenth SIAM Conference on Parallel Processing for Scientific Computing, 2001, Portsmouth, United States. 2001
Liste complète des métadonnées

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

Identifiants

  • HAL Id : inria-00346598, version 1

Collections

Citation

Pascal Hénon, Pierre Ramet, Jean Roman. PaStiX: A Parallel Direct Solver for Sparse SPD Matrices based on Efficient Static Scheduling and Memory Managment. Tenth SIAM Conference on Parallel Processing for Scientific Computing, 2001, Portsmouth, United States. 2001. 〈inria-00346598〉

Partager

Métriques

Consultations de la notice

69