A NUMA Aware Scheduler for a Parallel Sparse Direct Solver - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

A NUMA Aware Scheduler for a Parallel Sparse Direct Solver


Over the past few years, parallel sparse direct solvers have made significant progress. They are now able to solve efficiently real-life three-dimensional problems with several millions of equations. Nevertheless, the need of a large amount of memory is often a bottleneck in these methods. The authors have proposed an hybrid MPI-thread implementation of a direct solver that is well suited for SMP nodes or modern multi-core architectures. Modern multi-processing architectures are commonly based on shared memory systems with a NUMA behavior. These computers are composed of several chip-sets including one or several cores associated to a memory bank. Such an architecture implies hierarchical memory access times from a given core to the different memory banks which do not exist on SMP nodes. Thus, the main data structure of our targeted application have been modified to be more suitable for NUMA architectures. We also introduce a simple way of dynamically schedule an application based on a dependency tree while taking into account NUMA effects. Results obtained with these modifications are illustrated by showing performances of the PaStiX solver on different platforms and matrices.
Fichier principal
Vignette du fichier
i3m.pdf (323.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00416502 , version 1 (14-09-2009)


  • HAL Id : inria-00416502 , version 1


Mathieu Faverge, Pierre Ramet. A NUMA Aware Scheduler for a Parallel Sparse Direct Solver. Workshop on Massively Multiprocessor and Multicore Computers, INRIA, Feb 2009, Rocquencourt, France. 5p. ⟨inria-00416502⟩
114 View
124 Download


Gmail Facebook X LinkedIn More