FAVERGE, Mathieu; RAMET, Pierre

Metadatos

Licencia de uso del documento

FAVERGE, Mathieu
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Efficient runtime systems for parallel architectures [RUNTIME]

RAMET, Pierre
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]

Idioma

Communication dans un congrès

Este ítem está publicado en

PARA'08, 2008-05-13, Trondheim. 2008

Resumen en inglés

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.< Leer menos

Palabras clave en inglés

NUMA architecture

multi-cores

dynamic scheduling

sparse direct solver

URI

https://oskar-bordeaux.fr/handle/20.500.12278/198601

Proyecto ANR

Adaptation et Optimisation des Performances Applicatives sur architectures NUMA. Etude et Mise en Œuvre sur des Applications en SISmologie. - ANR-05-CIGC-0002

Orígen

Importado de Hal

Centros de investigación

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800