Multi-Level Domain-Decomposition Strategy for Solving the Eikonal Equation with the Fast-Sweeping Method

Distance field from a surface geometry is used in several scientific algorithms and applications from computer graphics, visualization, computational fluid dynamics and more. Distance field can be calculated efficiently by solving the eikonal equation at each grid point using the fast-sweeping metho...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems Vol. 29; no. 10; pp. 2297 - 2303
Main Authors: Shrestha, Anup, Senocak, Inanc
Format: Journal Article
Language:English
Published: New York IEEE 01.10.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Accelerators
Algorithms
Computational fluid dynamics
Computer graphics
Computer memory
Convergence
CUDA
Distributed memory
Domain decomposition methods
Eikonal equation
fast-sweeping method
Geometry
Graphics processing units
Heuristic algorithms
Mathematical model
MPI
OpenACC
Parallel processing
signed distance field
Strategy
Surface geometry
Sweeping
Two dimensional displays
ISSN:1045-9219, 1558-2183
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Distance field from a surface geometry is used in several scientific algorithms and applications from computer graphics, visualization, computational fluid dynamics and more. Distance field can be calculated efficiently by solving the eikonal equation at each grid point using the fast-sweeping method. There has been an increased interest to develop parallel algorithms for the fast-sweeping method to accelerate its computational turnaround time. Most parallel strategies have focused on shared-memory parallelism and do not readily extend to distributed-memory parallelism to handle large-scale problems. To address this issue, we propose a domain-decomposition strategy to enable distributed-memory parallelism for the fast-sweeping method on heterogeneous computing clusters with accelerators. In our strategy, we make use of the Cuthill-McKee ordering for both fine- and coarse-grain parallelism such that parallel computations proceed in direction of solution characteristics. We consider both CUDA and OpenACC implementations to compute the distance field from arbitrarily complex geometries and demonstrate parallel computations of large-scale problems that necessitate distributed-memory parallelism. We also discuss the implications of the proposed strategy for scalability of the fast-sweeping method.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2018.2829869