Computer
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
The IWIM Model for Coordination of Concurrent Activities
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Distributed Splitting of Constraint Satisfaction Problems
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Coordination of a heterogeneous coastal hydrodynamics application in Manifold
Coordination of a heterogeneous coastal hydrodynamics application in Manifold
Parallelizing CAD: a timely research agenda for EDA
Proceedings of the 45th annual Design Automation Conference
| Hi-index | 0.00 |
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 problem is separated from the generic branch and bound algorithm and the coordination strategy is separated from the 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.