Resource aggregation for task-based Cholesky Factorization on top of modern architectures - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Resource aggregation for task-based Cholesky Factorization on top of modern architectures

(1, 2) , (3, 2, 4) , (5) , (1, 2, 4) , (1, 2, 4)
1
2
3
4
5

Abstract

Hybrid computing platforms are now commonplace, featuring a large number of CPU cores and accelerators. This trend makes balancing computations between these heterogeneous resources performance critical. In this paper we propose ag-gregating several CPU cores in order to execute larger parallel tasks and improve load balancing between CPUs and accelerators. Additionally, we present our approach to exploit internal parallelism within tasks, by combining two runtime system schedulers: a global runtime system to schedule the main task graph and a local one one to cope with internal task parallelism. We demonstrate the relevance of our approach in the context of the dense Cholesky factorization kernel implemented on top of the StarPU task-based runtime system. We present experimental results showing that our solution outperforms state of the art implementations on two architectures: a modern heterogeneous machine and the Intel Xeon Phi Knights Landing.
Fichier principal
Vignette du fichier
submission.pdf (345.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01409965 , version 1 (06-12-2016)

Identifiers

  • HAL Id : hal-01409965 , version 1

Cite

Terry Cojean, Abdou Guermouche, Andra Hugo, Raymond Namyst, Pierre-André Wacrenier. Resource aggregation for task-based Cholesky Factorization on top of modern architectures. 2016. ⟨hal-01409965⟩
453 View
253 Download

Share

Gmail Facebook Twitter LinkedIn More