多GPU系统上的自适应多维求积
Adaptive Multidimensional Quadrature on Multi-GPU Systems
AI总结:
提出一种基于多GPU架构的分布式自适应多维求积方法,通过循环轮询的去中心化负载重分配方案解决负载不平衡问题,在高维计算中实现更高效率与鲁棒性。
摘要:
我们提出了一种分布式自适应求积方法,该方法将多维积分表述为多GPU架构上的分层区域分解问题。积分区域被递归地划分为多个子区域,其细化由局部误差估计器引导。每个子区域在GPU上独立演化,随着自适应过程的推进,这暴露了显著的负载不平衡。为了应对这一挑战,我们引入了一种基于循环轮询策略的去中心化负载重分配方案。该策略通过与计算重叠的非阻塞CUDA-aware MPI通信,动态地重新平衡设备间的子区域。与最先进的GPU定制软件包相比,所提策略有两个主要优势:在高维度上效率更高;以及相对于被积函数的正则性和目标精度具有更好的鲁棒性。
英文摘要:
We introduce a distributed adaptive quadrature method that formulates multidimensional integration as a hierarchical domain decomposition problem on multi-GPU architectures. The integration domain is recursively partitioned into subdomains whose refinement is guided by local error estimators. Each subdomain evolves independently on a GPU, which exposes a significant load imbalance as the adaptive process progresses. To address this challenge, we introduce a decentralised load redistribution schemes based on a cyclic round-robin policy. This strategy dynamically rebalance subdomains across devices through non-blocking, CUDA-aware MPI communication that overlaps with computation. The proposed strategy has two main advantages compared to a state-of-the-art GPU-tailored package: higher efficiency in high dimensions; and improved robustness w.r.t the integrand regularity and the target accuracy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。