.png){kind=icon}
返回
Solving Poisson's equation using FFT in a GPU cluster
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2016.09.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Poisson's equation is present in many scientific computations and its efficient solution is achieved by means of several methods. One of the most efficient methods is the Fast Fourier Transform (FFT), which is very widely used in lots of computational problems. In this work we implement a Poisson solver that uses FFT as base method and runs in a cluster of Graphics Processing Units (GPU). We analyze the execution of our implementation to find the main bottlenecks and we compare the results to a CPU based solver. The results show a good scalability up to 16 GPUs, the number of GPUs we have available. Moreover, although the main time consuming part of the process is the network communication, the GPU implementation is about 2.5 times faster than the CPU implementation. (C) 2016 Elsevier Inc. All rights reserved.
Keyword:
GPU
Poisson's equation
MPI
FFT
CUDA
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容