A NUMA Aware Scheduler for a Parallel Sparse Direct Solver

Abstract : Over the past few years, parallel sparse direct solvers made significant progress and are now able to solve efficiently industrial three-dimensional problems with several millions of unknowns. To solve efficiently these problems, PaStiX and WSMP solvers for example, provide an hybrid MPI-thread implementation well suited for SMP nodes or multi-core architectures. It enables to drastically reduce the memory overhead of the factorization and improve the scalability of the algorithms. However, today's modern architectures introduce new hierarchical memory accesses that are not handle in these solvers. We present in this paper three improvements on PaStiX solver to improve the performance on modern architectures : memory allocation, communication overlap and dynamic scheduling and some results on numerical test cases will be presented to prove the efficiency of the approach on NUMA architectures.
Type de document :
[Research Report] RR-7498, INRIA. 2010, pp.22
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

Contributeur : Mathieu Faverge <>
Soumis le : mercredi 22 décembre 2010 - 17:53:21
Dernière modification le : jeudi 13 décembre 2018 - 18:48:11
Document(s) archivé(s) le : lundi 5 novembre 2012 - 14:46:39


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00549827, version 1


Mathieu Faverge, Xavier Lacoste, Pierre Ramet. A NUMA Aware Scheduler for a Parallel Sparse Direct Solver. [Research Report] RR-7498, INRIA. 2010, pp.22. 〈inria-00549827〉



Consultations de la notice


Téléchargements de fichiers