# A fast 5/2-approximation algorithm for hierarchical scheduling

1 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 Theory of Parallelism
Department of Computer Science
Abstract : 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.
Keywords :
Type de document :
Communication dans un congrès
EUROPAR, 2010, Ischia, Italy. 16th International Euro-Par Conference, Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part I, 2010
Liste complète des métadonnées

Littérature citée [9 références]

https://hal.archives-ouvertes.fr/hal-00738518
Contributeur : Marin Bougeret <>
Soumis le : jeudi 4 octobre 2012 - 14:45:17
Dernière modification le : mardi 15 novembre 2016 - 01:05:16
Document(s) archivé(s) le : samedi 5 janvier 2013 - 03:59:33

### Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : hal-00738518, version 1

### Citation

Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. A fast 5/2-approximation algorithm for hierarchical scheduling. EUROPAR, 2010, Ischia, Italy. 16th International Euro-Par Conference, Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part I, 2010. 〈hal-00738518〉

Consultations de
la notice

## 281

Téléchargements du document