P2P computing for large tree exploration-based exact optimisation

Authors:
M. Mehdi;M. Mezmaz;N. Melab;E-G. Talbi;P. Bouvry
Affiliations:
Faculty of Sciences, Technology and Communication, University of Luxembourg, 6 rue Coudenhove Kalergi, L-1359, Luxembourg, Luxembourg.;INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d;Ascq, France.;INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40, avenue Halley, Bt. A, Park Plaza, 59650 Villeneuve d;Ascq, France.
Venue:
International Journal of Grid and Utility Computing
Year:
2009

Citing 4
Cited 0

Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Grid'BnB: a parallel branch and bound framework for grids

HiPC'07 Proceedings of the 14th international conference on High performance computing
Parallel branch and bound algorithms on internet connected workstations

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Branch and Bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimisation problems. In a previous article, we proposed a new approach of the parallel B&B algorithm for distributed systems using the farmer-worker paradigm. However, the new farmer-worker approach has a disadvantage: some nodes of the B&B tree can be explored by several B&B processes. To prevent this redundant work and speed up, we propose a new P2P approach inspired from the strategies of existing P2P systems like Napster and JXTA. Validation is performed by experimenting the two approaches on mono-objective flow-shop problem benchmarks using 500 processors belonging to the French national grid, Grid'5000. The obtained results prove the efficiency of the proposed P2P approach. Indeed, the execution time obtained with the P2P version, even if more communicative, is better than the farmer-worker's one.