Dynamic Scheduling for sparse direct Solver on NUMA architectures - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Dynamic Scheduling for sparse direct Solver on NUMA architectures

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

Dates and versions

inria-00344026 , version 1 (16-01-2009)

Identifiers

  • HAL Id : inria-00344026 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More