Algorithmic skeletons: structured management of parallel computation
Algorithmic skeletons: structured management of parallel computation
Algorithms and Theory of Computation Handbook
Algorithms and Theory of Computation Handbook
Efficient, flexible, and typed group communications in Java
JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
Overview of GridRPC: A Remote Procedure Call API for Grid Computing
GRID '02 Proceedings of the Third International Workshop on Grid Computing
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
Interactive and Descriptor-Based Deployment of Object-Oriented Grid Applications
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
ParadisEO: A Framework for Parallel and Distributed Metaheuristics
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A Problem-Specific Fault-Tolerance Mechanism for Asynchronous, Distributed Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
QoS in Parallel Programming through Application Managers
PDP '05 Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing
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
Grid'5000: A Large Scale and Highly Reconfigurable Grid Experimental Testbed
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
ProActive Parallel Suite: From Active Objects-Skeletons-Components to Environment and Deployment
Euro-Par 2008 Workshops - Parallel Processing
P2P computing for large tree exploration-based exact optimisation
International Journal of Grid and Utility Computing
Experiments in parallel constraint-based local search
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
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
| Hi-index | 0.00 |
This article presents Grid'BnB, a parallel branch and bound framework for grids. Branch and bound (B&B) algorithms find optimal solutions of search problems and NP-hard optimization problems. Grid'BnB is a Java framework that helps programmers to distribute problems over grids by hiding distribution issues. It is built over a masterworker approach and provides a transparent communication system among tasks. This work also introduces a new mechanism to localize computational nodes on the deployed grid. With this mechanism, we can determine if two nodes are on the same cluster. This mechanism is used in Grid'BnB to reduce inter-cluster communications. We run experiments on a nationwide grid. With this test bed, we analyze the behavior of a communicant application deployed on a large-scale grid that solves the flow-shop problem.