A Parallel P2P Branch-and-Bound Algorithm for Computational Grids

Simple item page
dc.contributor.authorBendjoudi, Ahcène
dc.contributor.authorMelab, Nouredine
dc.contributor.authorTalbi, El-Ghazali
dc.date.accessioned2013-06-12T10:15:16Z
dc.date.available2013-06-12T10:15:16Z
dc.date.issued2007-05-14
dc.description.abstractSolving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound algorithm requires a huge amount of computational resources. The efficiency of such algorithm can be improved by distributing at large scale the computation required by the exploration of the search tree. In this paper, we propose ParallelBB, which is a P2P-based parallelization of the Branch-and-Bound algorithm for the computational Grid. The algorithm has been implemented using the ProActive distributed object Grid middleware. The algorithm has been applied to a mono- criterion permutation flow-shop problem and promisingly experimented on the Grid5000 computational Grid.fr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/199
dc.relation.ispartofInternational Confernce on Cluster Computing and the Grid (CCGRID)
dc.relation.ispartofseriesInternational Confernce on Cluster Computing and the Grid (CCGRID) ..;
dc.relation.placeRio de Janeiro - Brasilfr_FR
dc.structureCalcul Pervasif et Mobilefr_FR
dc.subjectBranch and Bound, P2P, ProActive, Grid Computing, Flow-shopfr_FR
dc.titleA Parallel P2P Branch-and-Bound Algorithm for Computational Gridsfr_FR
dc.typeConference paper
Files
Collections
International Conference Papers