Scalable parallel numerical constraint solver using global load balancing

Daisuke Ishii, Kazuki Yoshizoe, Toyotaro Suzumura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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 search tree of the branch and prune algorithm is split and distributed through the two phases of GLB: a random workload stealing phase and a workload distribution and termination phase based on a hyper-cube-shaped graph called lifeline. The parallel solver is simply implemented with X10 that provides an implementation of GLB as a library. In experiments, NCSPs from the literature were solved and attained up to 516-fold speedup using 600 cores of the TSUBAME2.5 supercomputer. Optimal GLB configurations are analyzed.

Original languageEnglish
Title of host publicationX10 2015 - Proceedings of the ACM SIGPLAN Workshop on X10, co-located with PLDI 2015
EditorsJose Nelson Amaral, Olivier Tardieu
PublisherAssociation for Computing Machinery, Inc
Pages33-38
Number of pages6
ISBN (Electronic)9781450335867
DOIs
Publication statusPublished - Jun 14 2015
Externally publishedYes
Event5th ACM SIGPLAN Workshop on X10, X10 2015 - Portland, United States
Duration: Jun 14 2015 → …

Publication series

NameX10 2015 - Proceedings of the ACM SIGPLAN Workshop on X10, co-located with PLDI 2015

Conference

Conference5th ACM SIGPLAN Workshop on X10, X10 2015
Country/TerritoryUnited States
CityPortland
Period6/14/15 → …

All Science Journal Classification (ASJC) codes

  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Scalable parallel numerical constraint solver using global load balancing'. Together they form a unique fingerprint.

Cite this