A 54-approximation algorithm for scheduling identical malleable tasks

AbstractWe consider the problem of finding a schedule for n-independent identical malleable tasks on p identical processors with minimal completion time. This problem arises while using the branch-and-bound or the divide-and-conquer strategy to solve a problem on a parallel system. If nothing is known about the subproblems, then they are assumed to be identical. We assume that the execution time decreases with the number of processors while the computational work increases. We give an algorithm with execution time exponential in p which computes an optimal schedule. In order to approximate an optimal schedule, we use the concept of phase-by-phase schedules. Here schedules consist of phases in which every job uses the same number of processors. We prove that one can approximate an optimal schedule up to a factor of 54 using constant time, and we show that this is optimal. Furthermore, we give an ε-approximation algorithm if the speed-up is optimal up to a constant factor