Abstract
The Branch-and-Bound (B&B) is a fundamental algorithmic scheme for a large variety of global optimization methods. For many problems B&B requires the amount of computing resources far beyond the power of a single-CPU workstation thus making parallelization almost inevitable. The approach proposed in this paper allows one to evaluate load balancing algorithms for parallel B&B with various numbers of processors, sizes of the search tree, the characteristics of the supercomputer’s interconnect. The proposed approach was implemented as a special tool that simulates the process of resolution of the optimization problem by B&B method as a stochastic tree branching process. Data exchanges are modeled using the concept of logical time. The user-friendly graphical interface can render both real traces and ones produced by the simulator. It provides efficient visualization of the CPU’s load, data exchanges and progress of the optimization process.
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
References
Pardalos, P.M., Romeijn, E., Tuy, H.: Recent developments and trends in global optimization. J. Comput. Appl. Math. 124(1–2), 209–228 (2000)
Scholz, D.: Deterministic Global Optimization: Geometric Branch-and-Bound Methods and Their Applications. Springer, New York (2011)
Gendron, B., Crainic, T.G.: Parallel Branch-and-Bound Algorithms: Survey and Synthesis. Oper. Res. 42(6), 1042–1066 (1994)
Lüling, R., Monien, B.: Load balancing for distributed branch & bound algorithms. In: Proceedings of Sixth International Parallel Processing Symposium, pp. 543–548. IEEE (1992)
Barkalov, K., Gergel, V., Lebedev, I.: Use of xeon phi coprocessor for solving global optimization problems. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 307–318. Springer, Heidelberg (2015). doi:10.1007/978-3-319-21909-7_31
Ganglia Monitoring System. http://ganglia.sourceforge.net/. Accessed 12 June 2016
Nagios-the industry standard in IT infrastructure monitoring. https://www.nagios.org. Accessed 12 June 2016
Stefanov, K., Voevodin, V., Zhumatiy, S., Voevodin, V.: Dynamically reconfigurable distributed modular monitoring system for supercomputers (DiMMon). Procedia Comput. Sci. 66, 625–634 (2015)
Shende, S., Malony, A.D.: The TAU parallel performance system. Int. J. High Perform. Comput. Appl. 20(2), 287–331 (2006)
Adhianto, L., Banerjee, S., Fagan, M., Krentel, M., Marin, G., Mellor-Crummey, J., Tallent, N.R.: HPCToolkit: Tools for performance analysis of optimized parallel programs. Concurrency Comput.: Pract. Exp. 22(6), 685–701 (2010)
Servat, H., Llort, G., Giménez, J., Labarta, J.: Detailed performance analysis using coarse grain sampling. In: Lin, H.-X., Alexander, M., Forsell, M., Knüpfer, A., Prodan, R., Sousa, L., Streit, A. (eds.) Euro-Par 2009. LNCS, vol. 6043, pp. 185–198. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14122-5_23
Müller, M.S., Knüpfer, A., Jurenz, M., Lieber, M., Brunst, H., Mix, H., Nagel, W.E.: Developing scalable applications with vampir, vampirserver and vampirtrace. In: Proceedings of ParCo 2007, Jülich, Germany, pp. 637–644 (2007)
Mohr, B., Voevodin, V., Giménez, J., Hagersten, E., Knüpfer, A., Nikitenko, D.A., Nilsson, M., Servat, H., Shah, A., Winkler, F., Wolf, F., Zhukov, I.: The HOPSA workflow and tools. In: Proceedings of 6th International Parallel Tools Workshop, pp. 127–146 (2012)
Mohr, B.: Scalable parallel performance measurement and analysis tools-state-of-the-art and future challenges. Supercomput. Front. Innov. 1(2), 108–123 (2014)
De Bruin, A., Kan, A.H.R., Trienekens, H.W.: A simulation tool for the performance evaluation of parallel branch and bound algorithms. Math. Program. 42(1–3), 245–271 (1988)
Evtushenko, Y., Posypkin, M., Sigal, I.: A framework for parallel large-scale global optimization. Comput. Sci.-Res. Dev. 23(3–4), 211–215 (2009)
Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.: MPI, The Complete Reference. Scientific and Engineering Computation. MIT Press, Cambridge (1996)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)
Kolpakov, R.M., Posypkin, M.A.: Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem. J. Comput. Syst. Sci. Int. 50(5), 756–765 (2011)
Posypkin, M.A., Sigal, I.K.: Speedup estimates for some variants of the parallel implementations of the branch-and-bound method. Comput. Math. Math. Phys. 46(12), 2187–2202 (2006)
Voevodin, V., Antonov, A., Dongarra, J.: AlgoWiki: an open encyclopedia of parallel algorithmic features. Supercomput. Front. Innov. 2(1), 4–18 (2015)
Acknowledgements
This study was supported by Ministry of Science and Education of Republic of Kazakhstan, project 0115PK00554, Russian Fund for Basic Research, project16-07-00458 A, Leading Scientific Schools project NSH-8860.2016.1, Project I.33 of RAS.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Evtushenko, Y., Golubeva, Y., Orlov, Y., Posypkin, M. (2016). Using Simulation for Performance Analysis and Visualization of Parallel Branch-and-Bound Methods. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2016. Communications in Computer and Information Science, vol 687. Springer, Cham. https://doi.org/10.1007/978-3-319-55669-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-55669-7_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55668-0
Online ISBN: 978-3-319-55669-7
eBook Packages: Computer ScienceComputer Science (R0)