An approximation algorithm for scheduling trees of malleable tasks

This work presents an approximation algorithm for scheduling the tasks of a parallel application. These tasks are considered as malleable tasks (MT in short), which means that they can be executed on several processors. This model receives recently a lot of attention, mainly due to their practical use for implementing actual parallel applications. Most of the works developed within this model deal with independent MT for which good approximation algorithms have been designed. This work is devoted to the case where MT are linked by precedence relations. We present a 4(1+ ϵ) approximation algorithm (for any fixed ϵ) for the specific structure of a tree. This preliminary result should open the way for further investigations concerning arbitrary precedence graphs of MT.