The Branch-and-Bound method is known as one of the most powerful but very resource consuming global optimization methods. Parallel and distributed computing can efficiently cope with this issue. The major difficulty in parallel B&B method is the need for dynamic load redistribution. Therefore design and study of load balancing algorithms is a separate and very important research topic. This paper presents a tool for simulating parallel Branchand-Bound method. The simulator allows one to run load balancing algorithms with various numbers of processors, sizes of the search tree, the characteristics of the supercomputer’s interconnect thereby fostering deep study of load distribution strategies. The process of resolution of the optimization problem by B&B method is replaced by a stochastic branching process. Data exchanges are modeled using the concept of logical time. The user friendly graphical interface to the simulator provides efficient visualization and convenient performance analysis.
 Pardalos. P.M., Resende M. (Eds), Handbook of Applied Optimization Oxford University Press, 2002Search in Google Scholar
 Willebeek-LeMair M.H., Reeves A.P., Strategies for dynamic load balancing on highly parallel computers, Proc. of Parallel and Distributed Systems, IEEE Transactions on, 1993, 4 (9), 979-99310.1109/71.243526Search in Google Scholar
 Lüling R., Monien B., Load balancing for distributed branch & bound algorithms, Proceedings of Sixth International Parallel Processing Symposium, 1992, 543-548Search in Google Scholar
 Gergel V.A., Unified Approach to Use of Coprocessors of Various Types for Solving Global Optimization Problems, Proc. of Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI), IEEE, 13-18Search in Google Scholar
 Evtushenko Y., Posypkin M., Sigal I., A framework for parallel large-scale global optimization, Computer Science-Research and Development, 2009, 23 (3-4), 211-21510.1007/s00450-009-0083-7Search in Google Scholar
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.