A Case Study in Running a Parallel Branch and Bound Application on the Grid

Authors:
Kento Aida;Tomotaka Osumi
Affiliations:
Tokyo Institute of Technology/PRESTO, JST;Tokyo Institute of Technology
Venue:
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Year:
2005

Citing 0
Cited 7

An efficient load balancing strategy for grid-based branch and bound algorithm

Parallel Computing
A grid-aware MIP solver: Implementation and case studies

Future Generation Computer Systems
P2P design and implementation of a parallel branch and bound algorithm for grids

International Journal of Grid and Utility Computing
gluepy: A Simple Distributed Python Programming Framework for Complex Grid Environments

Languages and Compilers for Parallel Computing
Grid'BnB: a parallel branch and bound framework for grids

HiPC'07 Proceedings of the 14th international conference on High performance computing
Experiments in parallel constraint-based local search

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
A grid-aware branch, cut and price implementation

PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is parallelized with the hierarchical master-worker paradigm. This hierarchical algorithm performs master-worker computing in two levels, computing among PC clusters on the Grid and that among computing nodes in each PC cluster. This hierarchical manner reduces communication overhead by localizing frequent communication in tightly coupled computing resources, or a single PC cluster. The algorithm is implemented on a Grid testbed by using GridRPC middleware, Ninf-G and Ninf. In the implementation, communication among PC clusters is securely performed via Ninf-G, which uses Grid security service on the Globus Toolkit, and communication among computing nodes in each PC cluster is performed via Ninf, which enables fast invocation of remote computing routines. The experimental results showed that implementation of the application with the hierarchical master-worker paradigm using a combination of Ninf-G and Ninf effectively utilized computing resources on the Grid testbed in order to run the fine-grain application, where the average computation time of the single task was less than 1[sec].