This paper presents a parallelization of a Constraint Programming solver, OR-Tools, using the parallel framework Bobpp .
An argument in support of this approach is that the parallelization of algorithms searching for solutions in the research area is extensively studied over the world.
The novelty presented here is the study of a parallelization for which the control of the OR-Tools sequential search is limited. Using OR-Tools, it is possible to record the path from the tree’s root to a node so as to stop the search at a precise node. However, to start the search on a subtree, the entire path from the root of the main tree to the root of the sub-tree has to be replayed. This suggests that this leads to additional costs during the search.
To thwart this problem, different strategies of load balancing are tried to reduce the extra costs due to the redundant branches.