What Makes Affinity-Based Schedulers So Efficient ?

Olivier Beaumont 1, 2 Loris Marchal 3
1 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : The tremendous increase in the size and heterogeneity of supercomputers makes it very difficult to predict the performance of a scheduling algorithm. Therefore, dynamic solutions, where scheduling decisions are made at runtime have overpassed static allocation strategies. The simplicity and efficiency of dynamic schedulers such as Hadoop are a key of the success of the MapReduce framework. Dynamic schedulers such as StarPU, PaRSEC or StarSs are also developed for more constrained computations, e.g. task graphs coming from linear algebra. To make their decisions, these runtime systems make use of some static information, such as the distance of tasks to the critical path or the affinity between tasks and computing resources (CPU, GPU,\ldots) and of dynamic information, such as where input data are actually located. In this paper, we concentrate on two elementary linear algebra kernels, namely the outer product and the matrix multiplication. For each problem, we propose several dynamic strategies that can be used at runtime and we provide an analytic study of their theoretical performance. We prove that the theoretical analysis provides very good estimate of the amount of communications induced by a dynamic strategy, thus enabling to choose among them for a given problem and architecture.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-00875487
Contributor : Olivier Beaumont <>
Submitted on : Tuesday, October 22, 2013 - 10:57:16 AM
Last modification on : Tuesday, December 11, 2018 - 10:58:08 AM
Document(s) archivé(s) le : Friday, April 7, 2017 - 2:34:18 PM

File

RRRuntimeSchedulers.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00875487, version 1

Citation

Olivier Beaumont, Loris Marchal. What Makes Affinity-Based Schedulers So Efficient ?. 2013. ⟨hal-00875487⟩

Share

Metrics

Record views

386

Files downloads

202