Skip to Main content Skip to Navigation
Journal articles

Symbolic Mapping and Allocation for the Cholesky Factorization on NUMA machines: Results and Optimizations

Emmanuel Jeannot 1, 2
1 RUNTIME - Efficient runtime systems for parallel architectures
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : We discuss some performance issues of the tiled Cholesky factorization on non-uniform memory access-time (NUMA) shared memory machines. We show how to optimize thread and data placement in order to achieve performance gains up to 50% compared to state-of- the-art libraries such as PLASMA or MKL.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-00921611
Contributor : Emmanuel Jeannot <>
Submitted on : Friday, December 20, 2013 - 4:42:05 PM
Last modification on : Tuesday, February 9, 2021 - 3:12:02 PM
Long-term archiving on: : Friday, March 21, 2014 - 9:18:29 AM

File

jeannot.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00921611, version 1

Collections

Citation

Emmanuel Jeannot. Symbolic Mapping and Allocation for the Cholesky Factorization on NUMA machines: Results and Optimizations. International Journal of High Performance Computing Applications, SAGE Publications, 2013, 27 (3), pp.283--290. ⟨hal-00921611⟩

Share

Metrics

Record views

423

Files downloads

382