Scalable Parallel Numerical Constraint Solver Using Global Load Balancing

05/18/2015
by   Daisuke Ishii, et al.
0

We present a scalable parallel solver for numerical constraint satisfaction problems (NCSPs). Our parallelization scheme consists of homogeneous worker solvers, each of which runs on an available core and communicates with others via the global load balancing (GLB) method. The parallel solver is implemented with X10 that provides an implementation of GLB as a library. In experiments, several NCSPs from the literature were solved and attained up to 516-fold speedup using 600 cores of the TSUBAME2.5 supercomputer.

READ FULL TEXT
research
11/06/2014

Scalable Parallel Numerical CSP Solver

We present a parallel solver for numerical constraint satisfaction probl...
research
05/22/2021

On the Complexity and Parallel Implementation of Hensel's Lemma and Weierstrass Preparation

Hensel's lemma, combined with repeated applications of Weierstrass prepa...
research
08/24/2018

Asynchronous One-Level and Two-Level Domain Decomposition Solvers

Parallel implementations of linear iterative solvers generally alternate...
research
04/10/2019

A Three-Level Parallelisation Scheme and Application to the Nelder-Mead Algorithm

We consider a three-level parallelisation scheme. The second and third l...
research
10/27/2015

Redesigning pattern mining algorithms for supercomputers

Upcoming many core processors are expected to employ a distributed memor...
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...
research
07/12/2021

Parallel Element-based Algebraic Multigrid for H(curl) and H(div) Problems Using the ParELAG Library

This paper presents the use of element-based algebraic multigrid (AMGe) ...

Please sign up or login with your details

Forgot password? Click here to reset