 |
|
|
|
| HAL : hal-00738518, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| EUROPAR, Italie (2010) |
|
|
|
|
| A fast 5/2-approximation algorithm for hierarchical scheduling |
|
|
| Marin Bougeret 1Pierre-Francois Dutot 2, 3 |
|
|
| (2010) |
|
|
|
| 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 the minimization 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 $\frac{5}{2}$ ratio and runs in $O(log(np_{max})knlog(n))$, where $p_{max}$ 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) |
|
|
|
CNRS : UMR5506 – Université Montpellier II - Sciences et techniques |
|
|
| 2 : | MOAIS (INRIA Grenoble Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble) |
|
|
|
INRIA – Université Joseph Fourier - Grenoble I – Institut polytechnique de Grenoble (Grenoble INP) – Université Pierre-Mendès-France - Grenoble II – CNRS : UMR5217 |
|
|
| 3 : | Université Pierre Mendès France (Grenoble 2 UPMF) |
|
|
|
Université Pierre-Mendès-France - Grenoble II |
|
|
| 4 : | Department of Computer Science |
|
|
|
CAU Kiel |
|
|
| 5 : | Institut Universitaire de France (IUF) |
|
|
|
Ministère de l'Enseignement Supérieur et de la Recherche Scientifique |
|
|
|
|
|
|
|
|
|
| INFO/MAORE Theory of Parallelism |
|
|
|
|
| Domaine | : | Informatique/Algorithme et structure de données |
|
|
| scheduling – multiple strip packing – approximation algorithm |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00738518, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00738518 | |
| oai:hal.archives-ouvertes.fr:hal-00738518 | |
| Contributeur : Marin Bougeret | |
| Soumis le : Jeudi 4 Octobre 2012, 14:45:17 | |
| Dernière modification le : Jeudi 4 Octobre 2012, 15:54:42 | |
