An Approximation algorithm for scheduling Trees of Malleable Tasks

Abstract : 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, due mainly 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 1+epsilon approximation algorithm (for any fixed epsilon) for the specific structure of a tree. This preliminary result should open the way for further investigations concerning arbitrary precedence graphs of MT
Liste complète des métadonnées
Contributor : Grégory Mounié <>
Submitted on : Thursday, January 20, 2005 - 4:46:34 PM
Last modification on : Wednesday, March 13, 2019 - 3:02:02 PM
Document(s) archivé(s) le : Thursday, September 23, 2010 - 3:30:52 PM


  • HAL Id : hal-00001546, version 3




Renaud Lepère, Grégory Mounié, Denis Trystram. An Approximation algorithm for scheduling Trees of Malleable Tasks. European Journal of Operational Research, Elsevier, 2002, 142, pp.242-249. ⟨hal-00001546v3⟩



Record views


Files downloads