Skip to Main content Skip to Navigation

Branch-and-Bound with Peer-to-Peer for Large-Scale Grids

Alexandre Di Costanzo 1
1 OASIS - Active objects, semantics, Internet and security
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This thesis aims at facilitating the deployment of distributed applications on large-scale Grids, using a peer-to-peer (P2P) infrastructure for computational Grids. Furthermore, this thesis also propose a framework for solving optimization problem with branch-and-bound (B&B) technique.

Existing models and infrastructures for P2P computing are rather disappointing: only independent worker tasks with in general no communications between tasks, and very low level API. This thesis proposes to define a P2P infrastructure of computational nodes and to provide large-scale Grids. The infrastructure is an unstructured P2P network self-organized and configurable, also allowing deployment of communicant applications.

P2P environment seems well adapted to applications with low communication/computation ratio, such as parallel search algorithms and more particularly B&B algorithm. In addition, this thesis defines a parallel B&B framework for Grids. This framework helps programmers to distribute their problems over Grids by hiding all distribution issues. The framework is built over a hierarchical master-worker approach and provides a transparent communication system among tasks to improve the computation speedup.

First, we realized an implementation of this P2P infrastructure on top of the ProActive Java Grid middleware, therefore benefiting from underlying features of ProActive. The P2P infrastructure was deployed as a permanent desktop Grid, with which we have achieved a computation world record by solving the n-queens problem for 25 queens. Second, we achieved an implementation of this B&B framework, also on top of ProActive. We demonstrate the scalability and efficiency of the framework by deploying an application for solving the flow-shop problem on a nationwide Grid (Grid'5000). Finally, we mixed this Grid with our permanent desktop Grid to experiment large-scale deployment of both n-queens and flow-shop.
Complete list of metadatas
Contributor : Alexandre Di Costanzo <>
Submitted on : Monday, January 28, 2008 - 4:23:46 PM
Last modification on : Monday, October 12, 2020 - 10:30:21 AM
Long-term archiving on: : Thursday, September 27, 2012 - 5:45:49 PM


  • HAL Id : tel-00221450, version 1



Alexandre Di Costanzo. Branch-and-Bound with Peer-to-Peer for Large-Scale Grids. Networking and Internet Architecture [cs.NI]. Université Nice Sophia Antipolis, 2007. English. ⟨tel-00221450⟩



Record views


Files downloads