Conference Papers Year : 2014

Harnessing clusters of hybrid nodes with a sequential task-based programming model

Abstract

Runtime systems usually abstract a single node. The Sequential Task Flow (STF) model has been proven efficient on shared memory applications. When harnessing cluster of nodes, how should they communicate? By using explicit MPI user calls ? By using a specific paradigm ? Or can we keep the same STF paradigm and almost the same code, and leave the runtime system handle data transfers? We show how such a system has been sucessfully implemented on top of the StarPU runtime.
Fichier principal
Vignette du fichier
pmaa14.pdf (371.78 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01283949 , version 1 (07-03-2016)

Identifiers

  • HAL Id : hal-01283949 , version 1

Cite

Emmanuel Agullo, Olivier Aumage, Mathieu Faverge, Nathalie Furmento, Florent Pruvost, et al.. Harnessing clusters of hybrid nodes with a sequential task-based programming model. International Workshop on Parallel Matrix Algorithms and Applications (PMAA 2014), Jul 2014, Lugano, Switzerland. ⟨hal-01283949⟩
287 View
270 Download

Share

More