Parallel Branch and Bound on P2P Systems

Simple item page
dc.contributor.authorBendjoudi, Ahcène
dc.contributor.authorMelab, Nouredine
dc.contributor.authorTalbi, El-Ghazali
dc.date.accessioned2013-06-12T10:15:23Z
dc.date.available2013-06-12T10:15:23Z
dc.date.issued2007
dc.description.abstractReal or academic combinatorial optimization problems are in the majority NP-hard. For large dimensions, an exact resolution is often impractical due to a limited amount of resources. The use of large scale deployment on distributed systems such as peer-to-peer (P2P) systems, based on exploiting free CPU cycles, provides an efficient way to reach high computing performance by distributing the computation to solve these problems. In this paper, we are interested in solving exactly optimization problems using parallel branch-and-bound algorithm on large scale distributed systems. We propose ParallelBB, which is a parallelization of the branch-and-bound algorithm and apply it to a mono-criterion permutation flow-shop problem. Furthermore, we develop P2PBB, which is the peer-to-peer implementation of our algorithm using ProActivefr_FR
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/200
dc.publisherIEEEfr_FR
dc.relation.ispartofInternational Conference on Complex, Intelligent and Software Intensive Systems (CISIS)
dc.relation.ispartofseriesInternational Conference on Complex, Intelligent and Software Intensive Systems (CISIS);
dc.relation.placeVienna, Austriafr_FR
dc.structureCalcul Pervasif et Mobilefr_FR
dc.subjectBranch and Bound, P2P, ProActive, Grid Computing, Flow-shopfr_FR
dc.titleParallel Branch and Bound on P2P Systemsfr_FR
dc.typeConference paper
Files
Collections
International Conference Papers