BEAUMONT, Olivier; EYRAUD-DUBOIS, Lionel; GAO, Yihong

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

BEAUMONT, Olivier
Reformulations based algorithms for Combinatorial Optimization [Realopt]

EYRAUD-DUBOIS, Lionel
Reformulations based algorithms for Combinatorial Optimization [Realopt]

GAO, Yihong
Reformulations based algorithms for Combinatorial Optimization [Realopt]

Langue

Rapport

Ce document a été publié dans

2018-02-23

Résumé en anglais

In the context of HPC platforms, individual nodes nowadays consist in heterogenous processing resources such as GPU units and multicores. Those resources share communication and storage resources , what induces complex co-scheduling effects, and makes it hard to predict the exact duration of a task or of a communication. To cope with these issues, runtime dynamic schedulers such as StarPU have been developed. These systems base their decisions at runtime on the state of the platform and possibly on static priorities of tasks computed offline. In this paper, our goal is to quantify performance variability in the context of HPC heterogeneous nodes, by focusing on very regular dense linear algebra kernels. Then, we analyze the impact of this variability on a dynamic runtime scheduler such as StarPU, in order to analyze whether the strategies that have been designed in the context of MapReduce applications to cope with stragglers could be transferred to HPC systems, or if the dynamic nature of runtime schedulers is enough to cope with actual performance variations.< Réduire

URI

https://oskar-bordeaux.fr/handle/20.500.12278/193360

Project ANR

Solveurs pour architectures hétérogènes utilisant des supports d'exécution - ANR-13-MONU-0007

Origine

Importé de hal

Unités de recherche

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251