Scalable Parallel Numerical CSP Solver

11/06/2014
by   Daisuke Ishii, et al.
0

We present a parallel solver for numerical constraint satisfaction problems (NCSPs) that can scale on a number of cores. Our proposed method runs worker solvers on the available cores and simultaneously the workers cooperate for the search space distribution and balancing. In the experiments, we attained up to 119-fold speedup using 256 cores of a parallel computer.

READ FULL TEXT

page 3

page 7

research
05/18/2015

Scalable Parallel Numerical Constraint Solver Using Global Load Balancing

We present a scalable parallel solver for numerical constraint satisfact...
research
10/27/2015

Redesigning pattern mining algorithms for supercomputers

Upcoming many core processors are expected to employ a distributed memor...
research
09/19/2019

Experimenting with Constraint Programming on GPU

The focus of my PhD thesis is on exploring parallel approaches to effici...
research
12/18/2012

Prediction of Parallel Speed-ups for Las Vegas Algorithms

We propose a probabilistic model for the parallel execution of Las Vegas...
research
08/21/2019

A sufficient condition for a linear speedup in competitive parallel computing

In competitive parallel computing, the identical copies of a code in a p...
research
03/01/2022

Making use of supercomputers in financial machine learning

This article is the result of a collaboration between Fujitsu and Advest...
research
07/26/2021

A Parallel Boundary Element Method for the Electromagnetic Analysis of Large Structures With Lossy Conductors

In this paper, we propose an efficient parallelization strategy for boun...

Please sign up or login with your details

Forgot password? Click here to reset