Skip to Main content Skip to Navigation

Scheduling malleable task trees

Loris Marchal 1, 2 Frédéric Vivien 1, 2 Bertrand Simon 1, 2 
Abstract : 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.
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Monday, September 1, 2014 - 4:17:59 PM
Last modification on : Friday, September 30, 2022 - 4:12:07 AM
Long-term archiving on: : Tuesday, December 2, 2014 - 10:37:33 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads