A NUMA Aware Scheduler for a Parallel Sparse Direct Solver - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

A NUMA Aware Scheduler for a Parallel Sparse Direct Solver


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.
Fichier principal
Vignette du fichier
RR-7498.pdf (728.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00549827 , version 1 (22-12-2010)


  • 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⟩
678 View
262 Download


Gmail Facebook Twitter LinkedIn More