Grid'BnB: A parallel branch and bound framework for grids

11Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Caromel, D., Costanzo, A. D., Baduel, L., & Matsuoka, S. (2007). Grid’BnB: A parallel branch and bound framework for grids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4873 LNCS, pp. 566–579). Springer Verlag. https://doi.org/10.1007/978-3-540-77220-0_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free