A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
On-Line Multiple-Strip Packing
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Approximation algorithms for multiple strip packing
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Cooperation in multi-organization scheduling
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Job Allocation Strategies with User Run Time Estimates for Online Scheduling in Hierarchical Grids
Journal of Grid Computing
Scheduling jobs on heterogeneous platforms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem
Journal of Parallel and Distributed Computing
Adaptive parallel job scheduling with resource admissible allocation on two-level hierarchical grids
Future Generation Computer Systems
On-Line scheduling of parallel jobs in heterogeneous multiple clusters
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Coordination mechanisms for selfish parallel jobs scheduling
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A (2+ε)-approximation for scheduling parallel jobs in platforms
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Hi-index | 0.00 |
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel computing platform. A hierarchical parallel platform is a collection of k parallel machines of different sizes (number of processors). The jobs are submitted to a central queue and each job must be allocated to one of the k parallel machines (and then scheduled on some processors of this machine), targeting theminimization of the maximum completion time (makespan). We assume that no job require more resources than available on the smallest machine. This problem is hard and it has been previously shown that there is no polynomial approximation algorithm with a ratio lower than 2 unless P = NP. The proposed scheduling algorithm achieves a 5/2 ratio and runs in O(log(npmax)knlog(n)), where pmax is the maximum processing time of the jobs. Our results also apply for the Multi Strip Packing problem where the jobs (rectangles) must be allocated on contiguous processors.