Improved approximation algorithms for scheduling parallel jobs on identical clusters - Archive ouverte HAL
Article Dans Une Revue Theoretical Computer Science Année : 2015

Improved approximation algorithms for scheduling parallel jobs on identical clusters

Résumé

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.
Fichier principal
Vignette du fichier
submission_TCS2015_scheduling_R1.pdf (462.2 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01230293 , version 1 (11-07-2019)

Identifiants

Citer

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

Altmetric

Partager

More