Improved approximation algorithms for scheduling parallel jobs on identical clusters

Abstract : The Multiple Cluster Scheduling Problem corresponds to minimize the maximum completion time (makespan) of a set of n parallel rigid (and non-preemptive) jobs submitted to N identical clusters. It cannot be approximated with a ratio better than 2 (unless P = NP). We present in this paper the methodology that encompasses several existing results [1, 2]. We detail first how to apply it for obtaining a 5 -approximation. Then, we use it to provide a new 7 -approximation 23 running in O(log (nhmax)N(n + log(n))), where hmax is the processing time of the longest job. Finally, we apply it to a restriction of the problem to jobs of limited size, leading to a 2-approximation which is the best possible ratio since the restriction remains 2-inapproximable.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01230293
Contributor : Grégory Mounié <>
Submitted on : Thursday, July 11, 2019 - 10:59:01 AM
Last modification on : Thursday, July 11, 2019 - 1:40:51 PM

File

submission_TCS2015_scheduling_...
Files produced by the author(s)

Identifiers

Collections

Citation

Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek. Improved approximation algorithms for scheduling parallel jobs on identical clusters. Theoretical Computer Science, Elsevier, 2015, 600, pp.70-85. ⟨10.1016/j.tcs.2015.07.003⟩. ⟨hal-01230293⟩

Share

Metrics

Record views

543

Files downloads

26