| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [39 references]
https://hal.inria.fr/hal-01618526
Contributor : Samuel Thibault <>
Submitted on : Wednesday, October 18, 2017 - 9:51:54 AM
Last modification on : Tuesday, May 14, 2019 - 11:38:08 AM
Document(s) archivé(s) le : Friday, January 19, 2018 - 12:24:21 PM
Contributor : Samuel Thibault <>
Submitted on : Wednesday, October 18, 2017 - 9:51:54 AM
Last modification on : Tuesday, May 14, 2019 - 11:38:08 AM
Document(s) archivé(s) le : Friday, January 19, 2018 - 12:24:21 PM
File
tpds14.pdf
Files produced by the author(s)