Abstract
The paper describes a simulator of parallel Branch and Bound (BnB) method. Several subdomain trees for benchmark functions are analyzed, a characteristic Gaussian-like distribution is discovered. An algorithm of artificial tree generation is formulated according to this criterion. The process of simulator modeling is described, several computational experiments are conducted. Their results show a hyperbolic decrease trend for modeled time as the number of computational units grows, which is concluded to be similar to real systems.
References
[1] Lawler E.L., Wood D.E., Branch-and-bound methods: A survey, Operations research, 14(4), 1966, 699–71910.1287/opre.14.4.699Search in Google Scholar
[2] Evtushenko Y., Posypkin M., Sigal I., A framework for parallel large-scale global optimization, Computer Science-Research and Development, 23(3-4), 2009, 211–21510.1007/s00450-009-0083-7Search in Google Scholar
[3] Evtushenko Y., Posypkin M., Rybak L., Turkin A., Approximating a solution set of nonlinear inequalities, Journal of Global Optimization, 71(1), 2018, 129–14510.1007/s10898-017-0576-zSearch in Google Scholar
[4] Kolpakov R.M., Posypkin M.A., Sigal I.K., On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method, Automation and Remote Control, 71(10), 2010, 2152–216110.1134/S0005117910100140Search in Google Scholar
[5] Kolpakov R., Posypkin M., The Scalability Analysis of a Parallel Tree Search Algorithm, in International Conference on Optimization and Applications, Springer, 2018, 186–20110.1007/978-3-030-10934-9_14Search in Google Scholar
[6] Bychkov I., Manzyuk M., Semenov A., Zaikin O., Afanasiev A., Posypkin M., Technology for integrating idle computing cluster resources into volunteer computing projects, in 2015 5th International Workshop on Computer Science and Engineering: Information Processing and Control Engineering, WCSE 2015-IPCE, 2015Search in Google Scholar
[7] Ignatov A., Posypkin M., BOINC-based Branch-and-Bound, in Russian Supercomputing Days, Springer, 2018, 511–52210.1007/978-3-030-05807-4_43Search in Google Scholar
[8] Carothers C.D., Bauer D., Pearce S., ROSS: A high-performance, low-memory, modular Time Warp system, Journal of Parallel and Distributed Computing, 62(11), 2002, 1648–166910.1016/S0743-7315(02)00004-7Search in Google Scholar
[9] Casanova H., Giersch A., Legrand A., Quinson M., Suter F., Versatile, Scalable, and Accurate Simulation of Distributed Applications and Platforms, Journal of Parallel and Distributed Computing, 74(10), 2014, 2899–291710.1016/j.jpdc.2014.06.008Search in Google Scholar
[10] Legrand A., Marchal L., Casanova H., Scheduling distributed applications: the simgrid simulation framework, in CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings., IEEE, 2003, 138–14510.1109/CCGRID.2003.1199362Search in Google Scholar
[11] Posypkin M., Usov A., Implementation and verification of global optimization benchmark problems, Open Engineering, 7(1), 2017, 470–47810.1515/eng-2017-0050Search in Google Scholar
[12] Golubeva Y., Orlov Y., Posypkin M., A tool for simulating parallel branch-and-bound methods, Open Engineering, 6(1), 201610.1515/eng-2016-0031Search in Google Scholar
[13] Evtushenko Y., Golubeva Y., Orlov Y., Posypkin M., Using simulation for performance analysis and visualization of parallel Branch-and-Bound methods, in Russian Supercomputing Days, Springer, 2016, 356–36810.1007/978-3-319-55669-7_28Search in Google Scholar
[14] Gorchakov A., K-frontal method of nonuniform coverings, International Journal of Open Information Technologies, 7(8), 2019, 65–69Search in Google Scholar
[15] Gorchakov A., Ignatov A., Malyshev D., Posypkin M., Parallel algorithm for approximating the work space of a robot, International Journal of Open Information Technologies, 7(1), 2019, 1–7Search in Google Scholar
© 2020 Andrei Ignatov et al., published by De Gruyter
This work is licensed under the Creative Commons Attribution 4.0 International License.
