.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
GPU
Poisson's equation
MPI
FFT
CUDA
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K