arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.11558cs.MScs.DCcs.NAmath.NA
收藏

基于多GPU集群的可扩展H矩阵边界积分方程求解方法

A scalable H-matrix approach for the solution of boundary integral equations on multi-GPU clusters

Helmut Harbrecht, Peter Zaspel

摘要:

在这项工作中,我们考虑的边界积分方程的解决方案,通过一个可扩展的层次矩阵的方法配备了图形硬件,即图形处理单元(GPU)的集群。为此,我们扩展了现有的单GPU分层矩阵库hmglib,使其能够在许多GPU上扩展,并且可以耦合到任意应用程序代码。使用边界元法(BEM)求解器的模型GPU实现,我们能够实现超过67%的相对并行速度从128到1024 GPU的模型几何测试用例与150万个未知数和现实世界的几何测试用例与近120万个未知数。在集群Titan的1024个GPU上,解决150万个未知数问题需要不到6分钟,其中设置阶段需要5.7分钟,迭代求解器需要20秒。据作者所知,我们在这里讨论的第一个完全基于GPU的分布式内存并行分层矩阵开源库使用传统的H矩阵格式和自适应交叉逼近与应用BEM问题。

英文摘要:

In this work, we consider the solution of boundary integral equations by means of a scalable hierarchical matrix approach on clusters equipped with graphics hardware, i.e. graphics processing units (GPUs). To this end, we extend our existing single-GPU hierarchical matrix library hmglib such that it is able to scale on many GPUs and such that it can be coupled to arbitrary application codes. Using a model GPU implementation of a boundary element method (BEM) solver, we are able to achieve more than 67 percent relative parallel speed-up going from 128 to 1024 GPUs for a model geometry test case with 1.5 million unknowns and a real-world geometry test case with almost 1.2 million unknowns. On 1024 GPUs of the cluster Titan, it takes less than 6 minutes to solve the 1.5 million unknowns problem, with 5.7 minutes for the setup phase and 20 seconds for the iterative solver. To the best of the authors' knowledge, we here discuss the first fully GPU-based distributed-memory parallel hierarchical matrix Open Source library using the traditional H-matrix format and adaptive cross approximation with an application to BEM problems.

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

↑