Grid’BnB: a parallel branch and bound framework for grids. 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 master-worker 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.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Caniou, Yves; Codognet, Philippe; Richoux, Florian; Diaz, Daniel; Abreu, Salvador: Large-scale parallelism for constraint-based local search: the costas array case study (2015)
- Bendjoudi, A.; Melab, N.; Talbi, E-G.: An adaptive hierarchical master-worker (AHMW) framework for grids-application to B&B algorithms (2012)
- Caromel, Denis; di Costanzo, Alexandre; Baduel, Laurent; Matsuoka, Satoshi: Grid’BnB: A parallel branch and bound framework for grids (2007)