2006 15th IEEE International Conference on High Performance Distributed Computing
Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods
Paris
June 19-June 23
ISBN: 1-4244-0307-3
This paper describes the design of Bob++, a framework for implementing sequential and/or parallel search algorithms. To our knowledge, the Bob++ is among the rare frameworks that allow implementation of various search methods (B&B, D&C (divide-and-conquer), DP (dynamic programming), A*) for general COPs and run the application on any architecture (sequential/SMP machines, clusters/grids) with minimum modification in the source code. The Bob++ is based on the notion of global priority queue that encapsulates sequential data structures and load balancing strategies. This makes transparent the parallelizations of the search algorithms. To parallelize Bob++ library, we integrated it on Athapascan parallel programming interface which is a C++ library developed by the INRIA Apache project
Index Terms:
INRIA Apache project, Bob++ framework, optimization problem solving, branch-and-bound method, sequential search algorithm, parallel search algorithm, divide-and-conquer method, dynamic programming, sequential machines, SMP machines, cluster architecture, grid architecture, global priority queue, sequential data structure encapsulation, load balancing strategy, Bob++ library, Athapascan parallel programming interface, C++ library
Citation:
A. Djerrah, B. Le Cun, V.-D. Cung, C. Roucairol, "Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods," hpdc, pp.369-370, 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb