...
首页> 外文期刊>Procedia Computer Science >A Multi-GPU Fast Iterative Method for Eikonal Equations Using on-the-fly Adaptive Domain Decomposition
【24h】

A Multi-GPU Fast Iterative Method for Eikonal Equations Using on-the-fly Adaptive Domain Decomposition

机译:动态自适应域分解的电子方程组方程多GPU快速迭代方法

获取原文

摘要

The recent research trend of Eikonal solver focuses on employing state-of-the-art parallel computing technology, such as GPUs. Even though there exists previous work on GPU-based parallel Eikonal solvers, only little research literature exists on the multi-GPU Eikonal solver due to its complication in data and work management. In this paper, we propose a novel on-the-fly, adaptive domain decomposition method for efficient implementation of the Block-based Fast Iterative Method on a multi-GPU system. The proposed method is based on dynamic domain decomposition so that the region to be processed by each GPU is determined on-the-fly when the solver is running. In addition, we propose an efficient domain assignment algorithm that minimizes communication overhead while maximizing load balancing between GPUs. The proposed method scales well, up to 6.17× for eight GPUs, and can handle large computing problems that do not fit to limited GPU memory. We assess the parallel efficiency and runtime performance of the proposed method on various distance computation examples using up to eight GPUs.
机译:Eikonal求解器的最新研究趋势集中在采用最先进的并行计算技术,例如GPU。即使以前有关于基于GPU的并行Eikonal求解器的工作,但由于多GPU Eikonal求解器在数据和工作管理方面的复杂性,因此仅有很少的研究文献。在本文中,我们提出了一种新的实时自适应域分解方法,以在多GPU系统上有效实现基于块的快速迭代方法。所提出的方法基于动态域分解,以便在求解器运行时即时确定每个GPU所要处理的区域。此外,我们提出了一种有效的域分配算法,该算法可将通信开销降至最低,同时将GPU之间的负载平衡最大化。所提出的方法可以很好地扩展,对于八个GPU最高可达6.17倍,并且可以处理不适用于有限GPU内存的大型计算问题。我们在多达8个GPU的各种距离计算示例上评估了该方法的并行效率和运行时性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号