A hybrid parallel solver for systems of multivariate polynomials using CPUs and GPUs

Cheon Hyeon Park, Gershon Elber, Ku Jin Kim, Gye Young Kim, Jun Kyung Seong

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper deals with a problem of finding valid solutions to systems of polynomial constraints. Although there have been several quite successful algorithms based on domain subdivision to resolve this problem, some major issues are still demanding further research. Prime obstacles in developing an efficient subdivision-based polynomial constraint solver are the exhaustive, although hierarchical, search of the zero-set in the parameter domain, which is computationally demanding, and their scalability in terms of the number of variables. In this paper, we present a hybrid parallel algorithm for solving systems of multivariate constraints by exploiting both the CPU and the GPU multicore architectures. We dedicate the CPU for the traversal of the subdivision tree and the GPU for the multivariate polynomial subdivision. By decomposing the constraint solving technique into two different components, hierarchy traversal and polynomial subdivision, each of which is more suitable to CPUs and GPUs, respectively, our solver can fully exploit the availability of hybrid, multicore architectures of CPUs and GPUs. Furthermore, our GPU-based subdivision method takes advantage of the inherent parallelism in the multivariate polynomial subdivision. We demonstrate the efficacy and scalability of the proposed parallel solver through several examples in geometric applications, including Hausdorff distance queries, contact point computations, surfacesurface intersections, ray trap constructions, and bisector surface computations. In our experiments, the proposed parallel method achieves up to two orders of magnitude improvement in performance compared to the state-of-the-art subdivision-based CPU solver.

Original languageEnglish
Pages (from-to)1360-1369
Number of pages10
JournalCAD Computer Aided Design
Volume43
Issue number11
DOIs
Publication statusPublished - 2011 Nov 1
Externally publishedYes

Fingerprint

Program processors
Polynomials
Scalability
Point contacts
Parallel algorithms
Computer systems
Graphics processing unit
Availability
Experiments

Keywords

  • Bezier subdivision
  • Geometric constraint solver
  • Graphics hardware
  • Hybrid algorithm
  • Non-linear system

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Cite this

A hybrid parallel solver for systems of multivariate polynomials using CPUs and GPUs. / Park, Cheon Hyeon; Elber, Gershon; Kim, Ku Jin; Kim, Gye Young; Seong, Jun Kyung.

In: CAD Computer Aided Design, Vol. 43, No. 11, 01.11.2011, p. 1360-1369.

Research output: Contribution to journalArticle

Park, Cheon Hyeon ; Elber, Gershon ; Kim, Ku Jin ; Kim, Gye Young ; Seong, Jun Kyung. / A hybrid parallel solver for systems of multivariate polynomials using CPUs and GPUs. In: CAD Computer Aided Design. 2011 ; Vol. 43, No. 11. pp. 1360-1369.
@article{be176440823548319a7a1f210444fc20,
title = "A hybrid parallel solver for systems of multivariate polynomials using CPUs and GPUs",
abstract = "This paper deals with a problem of finding valid solutions to systems of polynomial constraints. Although there have been several quite successful algorithms based on domain subdivision to resolve this problem, some major issues are still demanding further research. Prime obstacles in developing an efficient subdivision-based polynomial constraint solver are the exhaustive, although hierarchical, search of the zero-set in the parameter domain, which is computationally demanding, and their scalability in terms of the number of variables. In this paper, we present a hybrid parallel algorithm for solving systems of multivariate constraints by exploiting both the CPU and the GPU multicore architectures. We dedicate the CPU for the traversal of the subdivision tree and the GPU for the multivariate polynomial subdivision. By decomposing the constraint solving technique into two different components, hierarchy traversal and polynomial subdivision, each of which is more suitable to CPUs and GPUs, respectively, our solver can fully exploit the availability of hybrid, multicore architectures of CPUs and GPUs. Furthermore, our GPU-based subdivision method takes advantage of the inherent parallelism in the multivariate polynomial subdivision. We demonstrate the efficacy and scalability of the proposed parallel solver through several examples in geometric applications, including Hausdorff distance queries, contact point computations, surfacesurface intersections, ray trap constructions, and bisector surface computations. In our experiments, the proposed parallel method achieves up to two orders of magnitude improvement in performance compared to the state-of-the-art subdivision-based CPU solver.",
keywords = "Bezier subdivision, Geometric constraint solver, Graphics hardware, Hybrid algorithm, Non-linear system",
author = "Park, {Cheon Hyeon} and Gershon Elber and Kim, {Ku Jin} and Kim, {Gye Young} and Seong, {Jun Kyung}",
year = "2011",
month = "11",
day = "1",
doi = "10.1016/j.cad.2011.08.030",
language = "English",
volume = "43",
pages = "1360--1369",
journal = "CAD Computer Aided Design",
issn = "0010-4485",
publisher = "Elsevier Limited",
number = "11",

}

TY - JOUR

T1 - A hybrid parallel solver for systems of multivariate polynomials using CPUs and GPUs

AU - Park, Cheon Hyeon

AU - Elber, Gershon

AU - Kim, Ku Jin

AU - Kim, Gye Young

AU - Seong, Jun Kyung

PY - 2011/11/1

Y1 - 2011/11/1

N2 - This paper deals with a problem of finding valid solutions to systems of polynomial constraints. Although there have been several quite successful algorithms based on domain subdivision to resolve this problem, some major issues are still demanding further research. Prime obstacles in developing an efficient subdivision-based polynomial constraint solver are the exhaustive, although hierarchical, search of the zero-set in the parameter domain, which is computationally demanding, and their scalability in terms of the number of variables. In this paper, we present a hybrid parallel algorithm for solving systems of multivariate constraints by exploiting both the CPU and the GPU multicore architectures. We dedicate the CPU for the traversal of the subdivision tree and the GPU for the multivariate polynomial subdivision. By decomposing the constraint solving technique into two different components, hierarchy traversal and polynomial subdivision, each of which is more suitable to CPUs and GPUs, respectively, our solver can fully exploit the availability of hybrid, multicore architectures of CPUs and GPUs. Furthermore, our GPU-based subdivision method takes advantage of the inherent parallelism in the multivariate polynomial subdivision. We demonstrate the efficacy and scalability of the proposed parallel solver through several examples in geometric applications, including Hausdorff distance queries, contact point computations, surfacesurface intersections, ray trap constructions, and bisector surface computations. In our experiments, the proposed parallel method achieves up to two orders of magnitude improvement in performance compared to the state-of-the-art subdivision-based CPU solver.

AB - This paper deals with a problem of finding valid solutions to systems of polynomial constraints. Although there have been several quite successful algorithms based on domain subdivision to resolve this problem, some major issues are still demanding further research. Prime obstacles in developing an efficient subdivision-based polynomial constraint solver are the exhaustive, although hierarchical, search of the zero-set in the parameter domain, which is computationally demanding, and their scalability in terms of the number of variables. In this paper, we present a hybrid parallel algorithm for solving systems of multivariate constraints by exploiting both the CPU and the GPU multicore architectures. We dedicate the CPU for the traversal of the subdivision tree and the GPU for the multivariate polynomial subdivision. By decomposing the constraint solving technique into two different components, hierarchy traversal and polynomial subdivision, each of which is more suitable to CPUs and GPUs, respectively, our solver can fully exploit the availability of hybrid, multicore architectures of CPUs and GPUs. Furthermore, our GPU-based subdivision method takes advantage of the inherent parallelism in the multivariate polynomial subdivision. We demonstrate the efficacy and scalability of the proposed parallel solver through several examples in geometric applications, including Hausdorff distance queries, contact point computations, surfacesurface intersections, ray trap constructions, and bisector surface computations. In our experiments, the proposed parallel method achieves up to two orders of magnitude improvement in performance compared to the state-of-the-art subdivision-based CPU solver.

KW - Bezier subdivision

KW - Geometric constraint solver

KW - Graphics hardware

KW - Hybrid algorithm

KW - Non-linear system

UR - http://www.scopus.com/inward/record.url?scp=80054689555&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054689555&partnerID=8YFLogxK

U2 - 10.1016/j.cad.2011.08.030

DO - 10.1016/j.cad.2011.08.030

M3 - Article

AN - SCOPUS:80054689555

VL - 43

SP - 1360

EP - 1369

JO - CAD Computer Aided Design

JF - CAD Computer Aided Design

SN - 0010-4485

IS - 11

ER -