Scheduling malleable task trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2014

Scheduling malleable task trees


Solving sparse linear systems can lead to processing tree workflows on a platform of processors. In this study, we use the model of malleable tasks motivated in [Prasanna96,Beaumont07] in order to study tree workflow schedules under two contradictory objectives: makespan minimization and memory minization. First, we give a simpler proof of the result of [Prasanna96] which allows to compute a makespan-optimal schedule for tree workflows. Then, we study a more realistic speed-up function and show that the previous schedules are not optimal in this context. Finally, we give complexity results concerning the objective of minimizing both makespan and memory.
Fichier principal
Vignette du fichier
RR-8587.pdf (663.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01059704 , version 1 (01-09-2014)


  • HAL Id : hal-01059704 , version 1


Loris Marchal, Frédéric Vivien, Bertrand Simon. Scheduling malleable task trees. [Research Report] RR-8587, INRIA. 2014. ⟨hal-01059704⟩
142 View
121 Download


Gmail Facebook Twitter LinkedIn More