Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods

Paris June 19-June 23

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/HPDC.2006.1652188

2006 15th IEEE International Conferen ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by A. Djerrah Articles by B. Le Cun Articles by V.-D. Cung Articles by C. Roucairol

	ASCII Text	x
	A. Djerrah, B. Le Cun, V.-D. Cung, C. Roucairol, "Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods," High-Performance Distributed Computing, International Symposium on, pp. 369-370, 2006 15th IEEE International Conference on High Performance Distributed Computing, 2006.

	BibTex	x
	@article{ 10.1109/HPDC.2006.1652188, author = {A. Djerrah and B. Le Cun and V.-D. Cung and C. Roucairol}, title = {Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods}, journal ={High-Performance Distributed Computing, International Symposium on}, volume = {0}, year = {2006}, isbn = {1-4244-0307-3}, pages = {369-370}, doi = {http://doi.ieeecomputersociety.org/10.1109/HPDC.2006.1652188}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - High-Performance Distributed Computing, International Symposium on TI - Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods SN - 1-4244-0307-3 SP369 EP370 A1 - A. Djerrah, A1 - B. Le Cun, A1 - V.-D. Cung, A1 - C. Roucairol, PY - 2006 KW - INRIA Apache project KW - Bob++ framework KW - optimization problem solving KW - branch-and-bound method KW - sequential search algorithm KW - parallel search algorithm KW - divide-and-conquer method KW - dynamic programming KW - sequential machines KW - SMP machines KW - cluster architecture KW - grid architecture KW - global priority queue KW - sequential data structure encapsulation KW - load balancing strategy KW - Bob++ library KW - Athapascan parallel programming interface KW - C++ library VL - 0 JA - High-Performance Distributed Computing, International Symposium on ER -

A. Djerrah, Lab. PRiSM, Universit de Versailles-Saint Quentin, Yvelines

B. Le Cun, Lab. PRiSM, Universit de Versailles-Saint Quentin, Yvelines

V.-D. Cung

C. Roucairol

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.