Skip to Main content Skip to Navigation
Journal articles

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

Grégory Mounié 1, 2, 3, 4, 5 Christophe Rapine 1, 2, 5 Denis Trystram 1, 2, 3, 5
2 APACHE - Parallel algorithms and load sharing
ID-IMAG - Informatique et Distribution, Inria Grenoble - Rhône-Alpes, UJF - Université Joseph Fourier - Grenoble 1
3 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
4 MESCAL - Middleware efficiently scalable
ID-IMAG - Informatique et Distribution, Inria Grenoble - Rhône-Alpes
Abstract : 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.
Complete list of metadata
Contributor : Grégory Mounié <>
Submitted on : Thursday, December 2, 2004 - 2:30:10 PM
Last modification on : Wednesday, March 10, 2021 - 1:50:03 PM
Long-term archiving on: : Friday, September 17, 2010 - 5:44:30 PM


  • HAL Id : hal-00002166, version 2





Grégory Mounié, Christophe Rapine, Denis Trystram. A 3/2-Dual Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.401--412. ⟨hal-00002166v2⟩



Record views


Files downloads