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.
Liste complète des métadonnées

https://hal.inria.fr/hal-01283949
Contributor : Marc Sergent <>
Submitted on : Monday, March 7, 2016 - 10:35:13 AM
Last modification on : Thursday, December 20, 2018 - 3:36:03 PM
Document(s) archivé(s) le : Sunday, November 13, 2016 - 8:10:42 AM

File

pmaa14.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01283949, version 1

Citation

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⟩

Share

Metrics

Record views

435

Files downloads

223