Overlay-Centric Load Balancing: Applications to UTS and B&B
| dc.citation.epage | 390 | |
| dc.citation.spage | 382 | |
| dc.contributor.author | Trong-Tuan, Vu | |
| dc.contributor.author | Derbel, Bilel | |
| dc.contributor.author | Asim, Ali | |
| dc.contributor.author | Bendjoudi, Ahcène | |
| dc.contributor.author | Melab, Nouredine | |
| dc.date.accessioned | 2013-06-12T10:14:40Z | |
| dc.date.available | 2013-06-12T10:14:40Z | |
| dc.date.issued | 2012-09-24 | |
| dc.description.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. | fr_FR |
| dc.identifier.doi | 10.1109/CLUSTER.2012.17 | |
| dc.identifier.uri | http://dl.cerist.dz/handle/CERIST/194 | |
| dc.relation.ispartof | IEEE International Conference on Cluster Computing (CLUSTER) | |
| dc.relation.ispartofseries | IEEE International Conference on Cluster Computing (CLUSTER); | |
| dc.relation.pages | 382 - 390 | fr_FR |
| dc.relation.place | Beijin, China | fr_FR |
| dc.rights.holder | IEEE | fr_FR |
| dc.structure | Calcul Pervasif et Mobile | fr_FR |
| dc.subject | Branch and Bound, P2P, Load Balancing, Hierarchical Master Worker | fr_FR |
| dc.title | Overlay-Centric Load Balancing: Applications to UTS and B&B | fr_FR |
| dc.type | Conference paper |