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

Author

Bendjoudi, Ahcène ; Melab, Nouredine ; Talbi, El-Ghazali

Author_Institution

Centre de Rech. sur I´´Inf. Sci. et Tech. (CERIST), Univ. A/Mira de Bejaia, Bejaia

fYear

2007

fDate

14-17 May 2007

Firstpage

749

Lastpage

754

Abstract

Solving 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.

Keywords

combinatorial mathematics; distributed object management; grid computing; middleware; optimisation; parallel algorithms; peer-to-peer computing; tree searching; combinatorial optimization problem; computational grid; monocriterion permutation flow-shop problem; parallel P2P branch-and-bound algorithm; proactive distributed object grid middleware; search tree; Concurrent computing; Distributed computing; Dolphins; Grid computing; Large scale integration; Large-scale systems; Middleware; Peer to peer computing; Processor scheduling; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Cluster Computing and the Grid, 2007. CCGRID 2007. Seventh IEEE International Symposium on

Conference_Location

Rio De Janeiro

Print_ISBN

0-7695-2833-3

Type

conf

DOI

10.1109/CCGRID.2007.7

Filename

4215447