arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.04876math.NAcs.DCcs.MScs.NA
收藏

GPU上两层Schwarz区域分解预处理器的实验研究

An Experimental Study of Two-Level Schwarz Domain Decomposition Preconditioners on GPUs

Ichitaro Yamazaki, Alexander Heinlein, Sivasankaran Rajamanickam

AI总结:

本文提出了FROSch区域分解求解器包,通过在单个GPU上运行多个MPI进程的新颖分解策略优化GDSW预处理器的GPU性能,实验表明该策略在Summit超算上使求解时间减少约2倍。

摘要:

广义Dryja--Smith--Widlund (GDSW) 预处理器是一种两层重叠Schwarz区域分解 (DD) 预处理器,它将经典的一级重叠Schwarz预处理器与能量最小化粗空间相耦合。当用于加速Krylov子空间迭代方法的收敛速度时,GDSW预处理器为求解由各种偏微分方程离散化产生的稀疏线性系统提供了鲁棒性和可扩展性。在本文中,我们提出了FROSch (Fast and Robust Schwarz),这是一个区域分解求解器包,为CPU和GPU集群实现了GDSW型预处理器。为了提高GPU上的求解器性能,我们使用了一种新颖的分解方法在每个GPU上运行多个MPI进程,降低了求解器的计算和存储成本,并潜在地提高了收敛速度。这使我们能够在使用GPU时获得与仅使用CPU相比具有竞争力或更快的性能。我们在配备NVIDIA V100 GPU的Summit超级计算机上演示了FROSch的性能,其中我们使用NVIDIA Multi-Process Service (MPS) 来实现我们的分解策略。该求解器具有多种算法和实现选择,这为GPU实现带来了机遇和挑战。我们使用不同的求解器选项进行了彻底的实验研究,包括在GPU上对局部重叠子域问题的精确或不精确求解。我们还讨论了使用不完全LU分解和稀疏三角求解的迭代变体作为近似局部求解器的效果,以及使用较低精度计算整个FROSch预处理器的效果。总体而言,使用GPU使求解时间减少了约 $2\times$ 倍,而数值建立时间的GPU加速则取决于求解器选项和局部矩阵大小。

英文摘要:

The generalized Dryja--Smith--Widlund (GDSW) preconditioner is a two-level overlapping Schwarz domain decomposition (DD) preconditioner that couples a classical one-level overlapping Schwarz preconditioner with an energy-minimizing coarse space. When used to accelerate the convergence rate of Krylov subspace iterative methods, the GDSW preconditioner provides robustness and scalability for the solution of sparse linear systems arising from the discretization of a wide range of partial different equations. In this paper, we present FROSch (Fast and Robust Schwarz), a domain decomposition solver package which implements GDSW-type preconditioners for both CPU and GPU clusters. To improve the solver performance on GPUs, we use a novel decomposition to run multiple MPI processes on each GPU, reducing both solver's computational and storage costs and potentially improving the convergence rate. This allowed us to obtain competitive or faster performance using GPUs compared to using CPUs alone. We demonstrate the performance of FROSch on the Summit supercomputer with NVIDIA V100 GPUs, where we used NVIDIA Multi-Process Service (MPS) to implement our decomposition strategy. The solver has a wide variety of algorithmic and implementation choices, which poses both opportunities and challenges for its GPU implementation. We conduct a thorough experimental study with different solver options including the exact or inexact solution of the local overlapping subdomain problems on a GPU. We also discuss the effect of using the iterative variant of the incomplete LU factorization and sparse-triangular solve as the approximate local solver, and using lower precision for computing the whole FROSch preconditioner. Overall, the solve time was reduced by factors of about $2\times$ using GPUs, while the GPU acceleration of the numerical setup time depend on the solver options and the local matrix sizes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑