What Makes Affinity-Based Schedulers So Efficient ? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2013

What Makes Affinity-Based Schedulers So Efficient ?


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.
Fichier principal
Vignette du fichier
RRRuntimeSchedulers.pdf (336.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00875487 , version 1 (22-10-2013)


  • HAL Id : hal-00875487 , version 1


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


Gmail Facebook X LinkedIn More