P2P design and implementation of a parallel branch and bound algorithm for grids

Authors:
Ahcene Bendjoudi;Nouredine Melab;El-Ghazali Talbi
Affiliations:
Division Theories et Ingenierie des Systemes Informatiques DTISI, CEntre de Recherche sur l;Information, Scientifique et Technique CERIST, Algiers, Algeria, Universite Abderrahmane Mira, Bejaia, Algeria.;Universite des Sciences et Technologies de Lille, LIFL/UMR CNRS 8022, INRIA Lille Nord Europe - DOLPHIN, 59655 Villeneuve d
Venue:
International Journal of Grid and Utility Computing
Year:
2009

Citing 13
Cited 3

A parallel branch-and-bound algorithm for MIN-based multiprocessors

SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem

Parallel Computing - High performance computing in operations research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
SETI@home: an experiment in public-resource computing

Communications of the ACM
High-Performance Parallel and Distributed Computing for the BMI Eigenvalue Problem

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
XtremWeb: A Generic Global Computing System

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
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
An Enabling Framework for Master-Worker Applications on the Computational Grid

HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
A Case Study in Running a Parallel Branch and Bound Application on the Grid

SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Peer-to-peer for computational grids: mixing clusters and desktop machines

Parallel Computing
A Grid-based Parallel Approach of the Multi-Objective Branch and Bound

PDP '07 Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing
Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed

International Journal of High Performance Computing Applications

An adaptive hierarchical master-worker (AHMW) framework for grids-Application to B&B algorithms

Journal of Parallel and Distributed Computing
A parallel distributed algorithm for the permutation flow shop scheduling problem

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Hierarchical branch and bound algorithm for computational grids

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solving optimally large instances of combinatorial optimisationproblems using Branch and Bound (B&B) algorithms is CPU-timeintensive and requires a large number of computational resources.To harness such huge amount of resources Peer-to-Peer (P2P)communications must be allowed between resources, and adaptive loadbalancing and fault-tolerance have to be dealt with when designingand implementing a B&B algorithm. In this paper, we propose aP2P design and implementation of a parallel B&B algorithm ontop of the ProActive grid middleware. Load distribution andfault-tolerance strategies are proposed to deal with the dynamicand heterogeneous characteristics of the computational grid. Theapproach has been promisingly applied to the Flow-Shop schedulingproblem and experimented on a computational pool of 1500 CPUs fromthe GRID'5000 Nation-wide experimental Grid.