Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Trong-Tuan Vu Connect in order to contact the contributor
Submitted on : Thursday, September 6, 2012 - 5:45:43 PM
Last modification on : Thursday, January 20, 2022 - 5:27:53 PM
Long-term archiving on: : Friday, December 16, 2016 - 10:56:43 AM


Files produced by the author(s)


  • HAL Id : hal-00728700, version 1


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⟩



Record views


Files downloads