Bridging the Gap between Performance and Bounds of Cholesky Factorization on Heterogeneous Platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Bridging the Gap between Performance and Bounds of Cholesky Factorization on Heterogeneous Platforms

Abstract

We consider the problem of allocating and scheduling dense linear application on fully heterogeneous platforms made of CPUs and GPUs. More specifically, we focus on the Cholesky factorization since it exhibits the main features of such problems. Indeed, the relative performance of CPU and GPU highly depends on the sub-routine: GPUs are for instance much more efficient to process regular kernels such as matrix-matrix multiplications rather than more irregular kernels such as matrix factorization. In this context, one solution consists in relying on dynamic scheduling and resource allocation mechanisms such as the ones provided by PaRSEC or StarPU. In this paper we analyze the performance of dynamic schedulers based on both actual executions and simulations, and we investigate how adding static rules based on an offline analysis of the problem to their decision process can indeed improve their performance, up to reaching some improved theoretical performance bounds which we introduce.
Fichier principal
Vignette du fichier
Camera_ready.pdf (322.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01120507 , version 1 (25-02-2015)

Identifiers

Cite

Emmanuel Agullo, Olivier Beaumont, Lionel Eyraud-Dubois, Julien Herrmann, Suraj Kumar, et al.. Bridging the Gap between Performance and Bounds of Cholesky Factorization on Heterogeneous Platforms. Heterogeneity in Computing Workshop 2015, May 2015, Hyderabad, India. ⟨10.1109/IPDPSW.2015.35⟩. ⟨hal-01120507⟩
650 View
686 Download

Altmetric

Share

Gmail Facebook X LinkedIn More