Bob + + : a Framework for Exact Combinatorial Optimization Methods on Parallel Machines
Bob + + : a Framework for Exact Combinatorial Optimization Methods on Parallel Machines
复制标题
Bob：并行机上精确组合优化方法的框架
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
B. L. Cun
中科院分区：
文献类型：
--
作者：
François Galea;B. L. Cun
本文的目的是提出Bob++框架的面向对象设计。Bob++是一个在并行和顺序机器上实现组合优化问题求解器的框架。在过去的十年中，已经提出了几个类似的框架，但每个框架都只关注一种方法，如分支定界法，分治法等。并且还提出了一种并行化，这是非常难以扩展的。我们提出了一个软件设计，其中：第一，几个精确的组合优化方法提供给用户来解决问题，第二，一个接口，以促进并行化的实施也提供了。并行化可以使用POSIX线程以及MPI，或者更专门的库，如Athapascan/Kaapi。关键词-组合优化，搜索算法，分支定界，聚类，网格计算
The aim of this article is to propose the object-oriented design of the Bob++ framework. Bob++ is a framework for implementing solvers for combinatorial optimization problems on parallel and sequential machines. Several similar frameworks have been proposed in the last decade but each of them only focuses in one method, said Branch-and-Bound, Divideand-Conquer, etc.. and proposes also one parallelization, which is very difficult to extend. We propose a software design where: first, several exact combinatorial optimization methods are made available to the user to solve a problem, and second, an interface to facilitate the implementation of a parallelization is also provided. Parallelizations may use POSIX threads as well as MPI, or more specialized libraries such as Athapascan/Kaapi. Keywords— Combinatorial Optimization, Search algorithms, Branch-and-Bound, Parallelism, Cluster, Grid Computing