A 3/2-Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks - Laboratoire de Modélisation et de Calcul
Article Dans Une Revue SIAM Journal on Computing Année : 2007

A 3/2-Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks

Résumé

A malleable task is a computational unit which may be executed on any arbitrary number of processors whose execution time depends on the amount of resources alloted to is. This paper presents a new approach for scheduling a set of independent malleable tasks which leads to a worst case guarantee of 3/2+epsilon for the minimization of the parallel execution time, for any fixed epsilon>0. The main idea of this approach is to focus on the determination of a good allotment, then, to solve the resulting problem with a fixed number of processors by a simple scheduling algorithm. The first phase is based on a dual approximation technique where the allotment problem is expressed as a knapsack problem for partitionning the set of tasks into two shelves of respective height 1 and 1/2.
Fichier principal
Vignette du fichier
MRT_indepSIAM.pdf (266.11 Ko) Télécharger le fichier

Dates et versions

hal-00002166 , version 1 (01-07-2004)
hal-00002166 , version 2 (02-12-2004)

Identifiants

Citer

Grégory Mounié, Christophe Rapine, Denis Trystram. A 3/2-Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks. SIAM Journal on Computing, 2007, 37 (2), pp.401--412. ⟨10.1137/S0097539701385995⟩. ⟨hal-00002166v2⟩
692 Consultations
464 Téléchargements

Altmetric

Partager

More