Skip to Main content Skip to Navigation
New interface
Conference papers

Dynamic Scheduling for sparse direct Solver on NUMA architectures

Mathieu Faverge 1, 2, 3, * Pierre Ramet 1, 2 
* Corresponding author
2 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
3 RUNTIME - Efficient runtime systems for parallel architectures
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : Over the past few years, parallel sparse direct solvers made significant progress and are now able to efficiently work on problems with several millions of equations. This paper presents some improvements on our sparse direct solver PaStiX1 for distributed Non-Uniform Memory Access architectures. We show results on two preliminary works: a memory allocation scheme more adapted to these architectures and a better overlap of communication by computation. We also present a dynamic scheduler that takes care of memory affinity and data locality.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Mathieu Faverge Connect in order to contact the contributor
Submitted on : Friday, January 16, 2009 - 3:27:37 PM
Last modification on : Saturday, June 25, 2022 - 10:31:01 AM
Long-term archiving on: : Thursday, October 11, 2012 - 12:30:16 PM


Files produced by the author(s)


  • HAL Id : inria-00344026, version 1



Mathieu Faverge, Pierre Ramet. Dynamic Scheduling for sparse direct Solver on NUMA architectures. PARA'08, May 2008, Trondheim, Norway. ⟨inria-00344026⟩



Record views


Files downloads