MG-FIM: A MULTI-GPU FAST ITERATIVE METHOD USING ADAPTIVE DOMAIN DECOMPOSITION

Citations

WEB OF SCIENCE

4
Citations

SCOPUS

4

초록

Applying the latest parallel computing technology has become a recent trend in Eikonal equation solvers. Many recent studies have focused on parallelization of Eikonal solvers for multithreaded CPUs or single GPU systems. However, multi-GPU Eikonal solvers are largely underresearched owing to their complexity in terms of data and task management. In this paper, we propose a novel adaptive domain decomposition method to realize an efficient implementation of the block-based fast iterative method on multiple GPUs. The proposed method progressively expands the computational domain assigned to each GPU to maximize load balancing and employs a locality-aware clustering algorithm to minimize inter-GPU communication overhead. We also propose various low-and high-level optimization techniques for GPU computing, such as overlapping CPU and GPU computation and inter-GPU data transfer using multiple CUDA streams. Thus, we effectively circumvent performance issues in the na{\i}\"ve parallelization using a regular decomposition method. The proposed method scales up to 6.6\times for eight GPUs. We demonstrate that our efficient parallel implementation of the proposed method achieves an improvement in runtime performance under various experimental setups.

키워드

Eikonal equationviscosity solutionGPUparallel computingjob schedulingload balancingFAST SWEEPING METHODFAST MARCHING METHODEIKONAL EQUATIONSHAPEIMPLEMENTATIONSALGORITHMS
제목
MG-FIM: A MULTI-GPU FAST ITERATIVE METHOD USING ADAPTIVE DOMAIN DECOMPOSITION
저자
Hong, SuminJang, GangheeJeong, Won-Ki
DOI
10.1137/21M1414644
발행일
2022
유형
Article
저널명
SIAM Journal on Scientific Computing
44
1
페이지
C54 ~ C76