Symbolic mapping and allocation for the Cholesky factorization on NUMA machines: Results and optimizations

Authors:
Emmanuel Jeannot
Affiliations:
Inria Bordeaux Sud-Ouest, LaBRI, France
Venue:
International Journal of High Performance Computing Applications
Year:
2013

Citing 2
Cited 0

Compact DAG representation and its symbolic scheduling

Journal of Parallel and Distributed Computing
DAGuE: A generic distributed DAG engine for High Performance Computing

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

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 improve performance. The final result is 50\% faster than PLASMA and 75\% faster than MKL.