Journal Articles IEEE Transactions on Parallel and Distributed Systems Year : 2017

Achieving High Performance on Supercomputers with a Sequential Task-based Programming Model

Abstract

The emergence of accelerators as standard computing resources on supercomputers and the subsequent architectural complexity increase revived the need for high-level parallel programming paradigms. Sequential task-based programming model has been shown to efficiently meet this challenge on a single multicore node possibly enhanced with accelerators, which motivated its support in the OpenMP 4.0 standard. In this paper, we show that this paradigm can also be employed to achieve high performance on modern supercomputers composed of multiple such nodes, with extremely limited changes in the user code. To prove this claim, we have extended the StarPU runtime system with an advanced inter-node data management layer that supports this model by posting communications automatically. We illustrate our discussion with the task-based tile Cholesky algorithm that we implemented on top of this new runtime system layer. We show that it enables very high productivity while achieving a performance competitive with both the pure Message Passing Interface (MPI)-based ScaLAPACK Cholesky reference implementation and the DPLASMA Cholesky code, which implements another (non-sequential) task-based programming paradigm.
Fichier principal
Vignette du fichier
tpds14.pdf (2) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01618526 , version 1 (18-10-2017)

Identifiers

Cite

Emmanuel Agullo, Olivier Aumage, Mathieu Faverge, Nathalie Furmento, Florent Pruvost, et al.. Achieving High Performance on Supercomputers with a Sequential Task-based Programming Model. IEEE Transactions on Parallel and Distributed Systems, In press, ⟨10.1109/TPDS.2017.2766064⟩. ⟨hal-01618526⟩
625 View
1028 Download

Altmetric

Share

More