A Framework for Coordinating Parallel Branch and Bound Algorithms
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.
KeywordsOutput Port Global Information Event Occurrence Global Knowledge Coordination Strategy
Unable to display preview. Download preview PDF.
- 1.S. Ahuja, N. Carriero, and D. Gelernter. Linda and friends. IEEE Computer, 19(8):26–34, 1986.Google Scholar
- 2.F. Arbab. Manifold version 2: Language reference manual. Technical report, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, 1995.Google Scholar
- 3.F. Arbab. The IWIM model for coordination of concurrent activities. In Coordination’ 96, Lecture Notes in Computer Science. Springer-Verlag, 1996.Google Scholar
- 4.F. Arbab and E.B.G. Monfroy. Distributed splitting of constraint satisfaction problems. In Coordination 2000, Lecture Notes in Computer Science. Springer-Verlag, 2000.Google Scholar
- 5.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.Google Scholar
- 6.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.Google Scholar
- 7.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.Google Scholar
- 8.L.G. Mitten. Branch-and-bound methods: General formulation and properties. In Operations Research 18, pages 25–35, 1970.Google Scholar
- 9.Michael J. Quinn. Parallel Computing—Theory and Practice. McGraw Hill, inc., 1994.Google Scholar
- 10.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.Google Scholar
- 11.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.Google Scholar
- 12.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.Google Scholar