Skip to Main content Skip to Navigation
Conference papers

An Efficient Hybrid P2P Approach for Non-redundant Tree Exploration in B&B Algorithms

Abstract : The branch and bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimization 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 instances 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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00684915
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Tuesday, April 3, 2012 - 2:52:35 PM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM

Identifiers

Collections

Citation

Malika Mehdi, Mohand Mezmaz, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry. An Efficient Hybrid P2P Approach for Non-redundant Tree Exploration in B&B Algorithms. IEEE Proceedings of International Workshop on P2P, Parallel, Grid and Internet Computing (In conj. with Complex, Intelligent and Software Intensive Systems, CISIS2008), Mar 2008, Barcelona, Spain. ⟨10.1109/CISIS.2008.64⟩. ⟨hal-00684915⟩

Share

Metrics

Record views

72