Abstract
Branch and bound algorithms can be used for a variety of optimization problems. They are known to be very well suited for parallelization, which is a useful property to investigate in the light of coordination. This paper presents a general framework for parallel branch and bound algorithms, implemented using the coordination language MANIFOLD. Within this framework, the code for the optimization problemis separated fromthe generic branch and bound algorithmand the coordination strategy is separated fromthe coordinated components. The framework is an example of how the use of a coordination language can lead to a clean, comprehensible and flexible software architecture for complex parallel systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Ahuja, N. Carriero, and D. Gelernter. Linda and friends. IEEE Computer, 19(8):26–34, 1986.
F. Arbab. Manifold version 2: Language reference manual. Technical report, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, 1995.
F. Arbab. The IWIM model for coordination of concurrent activities. In Coordination’ 96, Lecture Notes in Computer Science. Springer-Verlag, 1996.
F. Arbab and E.B.G. Monfroy. Distributed splitting of constraint satisfaction problems. In Coordination 2000, Lecture Notes in Computer Science. Springer-Verlag, 2000.
C.L. Blom, F. Arbab, S. Hummel, and I.J.P. Elshof. Coordination of a heterogeneous coastal hydrodynamics application in manifold. Technical Report SEN-R9833, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, 1998.
B. Le Cun and C. Roucairol et al. BoB: a unified platform for implementing branch-and-bound like algorithms. Technical Report 95/16, Laboratoire PRiSM, Université de Versailles, Saint Quentin en Yvelines, 1995.
J. Eckstein, C.A. Phillips, and W.E. Hart. PICO: An object-oriented framework for parallel branch and bound. Technical report, Rutgers Center for Operations Research, Rutgers University, New Jersey, 2000.
L.G. Mitten. Branch-and-bound methods: General formulation and properties. In Operations Research 18, pages 25–35, 1970.
Michael J. Quinn. Parallel Computing—Theory and Practice. McGraw Hill, inc., 1994.
Y. Shinano, M. Higaki, and R. Hirabayashi. A generalized utility for parallel branch and bound algorithms. Technical report, Department of Management Science, Science University of Tokyo, 1994.
H.W.J.M. Trienekens and A. de Bruin. Towards a taxonomy of parallel branch and bound algorithms. Technical Report EUR-CS-92-01, Erasmus University Rotterdam, Dept. of Computer Science, 1992.
S. Tschöke and T. Polzer. Portable parallel branch-and-bound library PPBBLib user manual, library version 2.0. Technical report, Department of Computer Science, University of Paderborn, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stam, A. (2002). A Framework for Coordinating Parallel Branch and Bound Algorithms. In: Arbab, F., Talcott, C. (eds) Coordination Models and Languages. COORDINATION 2002. Lecture Notes in Computer Science, vol 2315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46000-4_30
Download citation
DOI: https://doi.org/10.1007/3-540-46000-4_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43410-8
Online ISBN: 978-3-540-46000-8
eBook Packages: Springer Book Archive