Overlay-Centric Load Balancing: Applications to UTS and B&B

Abstract : To deal with dynamic load balancing in large scale distributed systems, we propose to organize computing resources following a logical peer-to-peer overlay and to distribute the load according to the so-defined overlay. We use a tree as a logical structure connecting distributed nodes and we balance the load according to the size of induced subtrees. We conduct extensive experiments involving up to 1000 computing cores and provide a throughout analysis of different properties of our generic approach for two different applications, namely, the standard Unbalanced Tree Search and the more challenging parallel Branch-and-Bound algorithm. Substantial improvements are reported in comparison with the classical random work stealing and two finely tuned application specific strategies taken from the literature.
Type de document :
Communication dans un congrès
CLUSTER - 14th IEEE International Conference on Cluster Computing, Sep 2012, Beijing, China. 2012
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00728700
Contributeur : Trong-Tuan Vu <>
Soumis le : jeudi 6 septembre 2012 - 17:45:43
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13
Document(s) archivé(s) le : vendredi 16 décembre 2016 - 10:56:43

Fichier

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

Identifiants

  • HAL Id : hal-00728700, version 1

Citation

Trong-Tuan Vu, Bilel Derbel, Ali Asim, Ahcène Bendjoudi, Nouredine Melab. Overlay-Centric Load Balancing: Applications to UTS and B&B. CLUSTER - 14th IEEE International Conference on Cluster Computing, Sep 2012, Beijing, China. 2012. 〈hal-00728700〉

Partager

Métriques

Consultations de la notice

388

Téléchargements de fichiers

198