Skip to Main content Skip to Navigation
Reports

Hybrid static/dynamic scheduling for already optimized dense matrix factorization

Abstract : We present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully static scheduling. On a 16-core Intel Xeon machine, our hybrid static/dynamic scheduling approach is up to 8% faster than the version of CALU that uses a fully static scheduling or fully dynamic scheduling. Our algorithm leads to speedups over the corresponding routines for computing LU factorization in well known libraries. On the 48 core AMD NUMA machine, our best implementation is up to 110% faster than MKL, while on the 16 core Intel Xeon machine, it is up to 82% faster than MKL. Our approach also shows significant speedups compared with PLASMA on both of these systems.
Complete list of metadata

https://hal.inria.fr/inria-00631348
Contributor : Simplice Donfack <>
Submitted on : Thursday, October 20, 2011 - 2:09:48 PM
Last modification on : Thursday, July 8, 2021 - 3:48:44 AM
Long-term archiving on: : Saturday, January 21, 2012 - 2:26:56 AM

File

RR-7775.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00631348, version 2

Collections

Citation

Simplice Donfack, Laura Grigori, William D. Gropp, Vivek Kale. Hybrid static/dynamic scheduling for already optimized dense matrix factorization. [Research Report] RR-7775, INRIA. 2011, pp.29. ⟨inria-00631348v2⟩

Share

Metrics

Record views

836

Files downloads

1460