Overlay-Centric Load Balancing: Applications to UTS and B&B - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

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.
Fichier principal
Vignette du fichier
CLUSTER2012_VU.pdf (355.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00728700 , version 1 (06-09-2012)

Identifiers

  • HAL Id : hal-00728700 , version 1

Cite

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, IEEE, Sep 2012, Beijing, China. ⟨hal-00728700⟩
252 View
114 Download

Share

Gmail Facebook X LinkedIn More