The Community for Technology Leaders
2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (2012)
Shanghai, China China
May 21, 2012 to May 25, 2012
ISBN: 978-1-4673-0974-5
pp: 878-885
ABSTRACT
We consider the Multiple Cluster Scheduling Problem (MCSP), where the objective is to schedule n parallel rigid jobs on N identical clusters, minimizing the maximum completion time (make span). MCSP is 2-inapproximable (unless P=NP), and several approximation algorithms have already been proposed. However, ratio 2 has only been reached by algorithms that use extremely costly and complex subroutines as "black boxes" which are polynomial and yet impractical due to prohibitive constants. Our objective within this work is to determine a reasonable restriction of MCSP where the in approximability lower bound could be tightened in almost linear time. Thus, we consider a restriction of MCSP where jobs do not require strictly more than half of the processors of a cluster, and we provide a 2-approximation running in O(log(nh_{max})n(N+log(n))), where h_{max} is the processing time of the longest job. This approximation is the best possible, as this restriction (and even simpler ones) remains 2-inapproximable.
INDEX TERMS
Strips, Approximation methods, Approximation algorithms, Silicon, Clustering algorithms, Program processors, Schedules
CITATION

M. Bougeret, P. Dutot, K. Jansen, C. Robenek and D. Trystram, "Tight Approximation for Scheduling Parallel Jobs on Identical Clusters," 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum(IPDPSW), Shanghai, China China, 2012, pp. 878-885.
doi:10.1109/IPDPSW.2012.108
183 ms
(Ver 3.3 (11022016))