FiberSCIP - A shared memory parallelization of SCIP

  • Recently, parallel computing environments have become significantly popular. In order to obtain the benefit of using parallel computing environments, we have to deploy our programs for these effectively. This paper focuses on a parallelization of SCIP (Solving Constraint Integer Programs), which is a mixed-integer linear programming solver and constraint integer programming framework available in source code. There is a parallel extension of SCIP named ParaSCIP, which parallelizes SCIP on massively parallel distributed memory computing environments. This paper describes FiberSCIP, which is yet another parallel extension of SCIP to utilize multi-threaded parallel computation on shared memory computing environments, and has the following contributions: First, we present the basic concept of having two parallel extensions, and the relationship between them and the parallelization framework provided by UG (Ubiquity Generator), including an implementation of deterministic parallelization. Second, we discuss the difficulties in achieving a good performance that utilizes all resources on an actual computing environment, and the difficulties of performance evaluation of the parallel solvers. Third, we present a way to evaluate the performance of new algorithms and parameter settings of the parallel extensions. Finally, we demonstrate the current performance of FiberSCIP for solving mixed-integer linear programs (MIPs) and mixed-integer nonlinear programs (MINLPs) in parallel.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Yuji ShinanoORCiD, Stefan Heinz, Stefan Vigerske, Michael Winkler
Document Type:Article
Parent Title (English):INFORMS Journal on Computing
Volume:30
Issue:1
First Page:11
Last Page:30
Year of first publication:2018
Preprint:urn:nbn:de:0297-zib-42595
DOI:https://doi.org/10.1287/ijoc.2017.0762