Integration of ParaSCIP solvers running on several clusters on the base of Everest cloud platform
Pages 13 - 18
Abstract
Software integration of optimization problems’ solvers leveraging power of heterogeneous computing environments is a great challenge of last decades. Last several years we have been developing coarse-grained parallelization approaches to speed up Branch-and-Bound (BnB) algorithm for discrete and global optimization problems by exchange of BnB-incumbents in a heterogeneous environment containing standalone servers and clusters via Everest software toolkit, http://everest.distcomp.org. This approach have been implemented as DDBNB Everest-application (Domain Decomposition BnB), https://github.com/distcomp/ddbnb. The current implementation is based on two solvers (and their open API to get/put incumbents): SCIP, https://scip.zib.de and CBC, https://github.com/coin-or/Cbc. Recently we began to use ParaSCIP solver, https://ug.zib.de, - parallel implementation of BnB-algorithm in SCIP based on MPI. ParaSCIP demonstrates an advantages of fine-grained parallelization in homogeneous computing environment, i.e. HPC-clusters. By now we have access to three clusters from Russian Top50 where ParaSCIP have been installed. In the article several ways to involve ParaSCIP processes running on different clusters in solving common optimization problem are discussed.
References
[1]
S. A. Smirnov, V. V. Voloshinov, Packing of Circles on Square Flat Torus as Global Optimization of Mixed Integer Nonlinear Problem. arXiv:1809.10525.
[2]
S. Smirnov, V. Voloshinov, On domain decomposition strategies to parallelize branch-and-bound method for global optimization in Everest distributed environment, Procedia Computer Science 136 (2018) 128–135. doi:10.1016/j.procs.2018.08.245.
[3]
O. Sukhoroslov, S. Volkov, A. Afanasiev, A web-based platform for publication and distributed execution of computing applications, Parallel and Distributed Computing (ISPDC), 2015 14th International Symposium on (2015) 175–184. doi:10.1109/ISPDC.2015.27.
[4]
Parallel combinatorial optimization. Ed. El-Ghazali Talbi, Vol. 58, John Wiley & Sons, 2006.
[5]
T.G. Crainic, B. Le Cun, C. Roucairol, Parallel branch-and-bound algorithms, in: E.-G. Talbi (Ed.), Parallel combinatorial optimization, John Wiley & Sons, 2006, pp. 1–28.
[6]
Parallel and Distributed Optimization with Gurobi, [online], http://www.gurobi.com/pdfs/webinar-parallel-and-distributed-optimization-english.pdf (2015).
[7]
Y. Shinano, T. Achterberg, T. Berthold, S. Heinz, T. Koch, ParaSCIP: a parallel extension of SCIP. Competence in High Performance Computing 2010, Springer, 2011, pp. 135–148.
[8]
S. Smirnov, V. Voloshinov, Implementation of concurrent parallelization of branch-and-bound algorithm in Everest distributed environment, Procedia Computer Science 119 (2017) 83–89. doi:10.1016/j.procs.2017.11.163.
[9]
V. Voloshinov, S. Smirnov, O. Sukhoroslov, Implementation and use of coarse-grained parallel branch-and-bound in Everest distributed environment, Procedia Computer Science 108 (2017) 1532–1541.
[10]
N. T. Karonis, B. Toonen, I. Foster, MPICH-g2: A grid-enabled implementation of the message passing interfacearXiv:cs/0206040. URL http://arxiv.org/abs/cs/0206040
[11]
T. Beisel, E. Gabriel, M. Resch, An extension to MPI for distributed computing on MPPs, in: M. Bubak, J. Dongarra, J. Waśniewski (Eds.), Recent Advances in Parallel Virtual Machine and Message Passing Interface, Vol. 1332, Springer Berlin Heidelberg, pp. 75–82. 1007/3-540-63697-8_72. URL http://link.springer.com/10.1007/3-540-63697-8_72
[12]
C. Coti, T. Herault, F. Cappello, MPI applications on grids: A topology aware approach, in: H. Sips, D. Epema, H.-X. Lin (Eds.), Euro-Par 2009 Parallel Processing, Vol. 5704, Springer Berlin Heidelberg, pp. 466–477. URL http://link.springer.com/10.1007/978-3-642-03869-3_45
[13]
C. Kauhaus, A. Knoth, T. Peiselt, D. Fey, Efficient message passing on multi-clusters: An IPv6 extension to open MPI 6.
[14]
G. Adam, M. Bashashin, D. Belyakov, M. Kirakosyan, M. Matveev, D. Podgainy, et al., IT-ecosystem of the HybriLIT heterogeneous platform for highperformance computing and training of IT-specialists, Selected Papers of the 8th International Conference Distributed Computing and Grid-technologies in Science and Education (GRID 2018), Dubna, Russia, CEUR-WS.org/ 2267 (2018) 638–644.
Index Terms
- Integration of ParaSCIP solvers running on several clusters on the base of Everest cloud platform
Index terms have been assigned to the content through auto-classification.
Recommendations
Implementation of Concurrent Parallelization of Branch-and-bound algorithm in Everest Distributed Environment
Effectively parallelizing of branch-and-bound (BnB) solvers for mathematical programming problems with discrete variables in distributed computing environment is an important issue. Recently Everest web-based environment has been equipped with a generic ...
Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming
This paper considers the solution of Mixed Integer Nonlinear Programming (MINLP) problems. Classical methods for the solution of MINLP problems decompose the problem by separating the nonlinear part from the integer part. This approach is largely due to ...
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Existing global optimization techniques for nonconvex quadratic programming (QP) branch by recursively partitioning the convex feasible set and thus generate an infinite number of branch-and-bound nodes. An open question of theoretical interest is how ...
Comments
Information & Contributors
Information
Published In
Copyright © 2019.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 01 January 2019
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025