Scheduling Trees of Malleable Tasks for Sparse Linear Algebra - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Scheduling Trees of Malleable Tasks for Sparse Linear Algebra


Scientific workloads are often described by directed acyclic task graphs. This is in particular the case for multifrontal factorization of sparse matrices —the focus of this paper— whose task graph is struc-tured as a tree of parallel tasks. Prasanna and Musicus advocated using the concept of malleable tasks to model parallel tasks involved in matrix computations. In this powerful model each task is processed on a time-varying number of processors. Following Prasanna and Musicus, we consider malleable tasks whose speedup is p α , where p is the fractional share of processors on which a task executes, and α (0 < α ≤ 1) is a task-independent parameter. Firstly, we use actual experiments on mul-ticore platforms to motivate the relevance of this model for our application. Then, we study the optimal time-minimizing allocation proposed by Prasanna and Musicus using optimal control theory. We greatly simplify their proofs by resorting only to pure scheduling arguments. Building on the insight gained thanks to these new proofs, we extend the study to distributed (homogeneous or heterogeneous) multicore platforms. We prove the NP-completeness of the corresponding scheduling problem, and we then propose some approximation algorithms.
Fichier principal
Vignette du fichier
europar.pdf (314.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01160104 , version 1 (04-06-2015)


  • HAL Id : hal-01160104 , version 1


Abdou Guermouche, Loris Marchal, Bertrand Simon, Frédéric Vivien. Scheduling Trees of Malleable Tasks for Sparse Linear Algebra. International European Conference on Parallel and Distributed Computing (Euro-Par 2015), 2015, Vienna, Austria. ⟨hal-01160104⟩
212 View
176 Download


Gmail Facebook Twitter LinkedIn More