Peer to peer computing for large tree exploration-based exact optimization - Archive ouverte HAL Access content directly
Journal Articles International Journal of Grid and Utility Computing Year : 2009

Peer to peer computing for large tree exploration-based exact optimization

(1) , (2) , (3) , (4) , (4)
1
2
3
4

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.
Not file

Dates and versions

hal-00836778 , version 1 (21-06-2013)

Identifiers

Cite

Malika Mehdi, Mohand Mezmaz, Pascal Bouvry, Nouredine Melab, El-Ghazali Talbi. Peer to peer computing for large tree exploration-based exact optimization. International Journal of Grid and Utility Computing, 2009, 1 (3), pp.252-260. ⟨10.1504/IJGUC.2009.027652⟩. ⟨hal-00836778⟩
99 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More