English

Scalable Multi-node Fast Fourier Transform on GPUs

Computational Physics 2022-02-28 v1

Abstract

In this paper, we present the details of our multi-node GPU-FFT library, as well its scaling on Selene HPC system. Our library employs slab decomposition for data division and MPI for communication among GPUs. We performed GPU-FFT on 102431024^3, 204832048^3, and 409634096^3 grids using a maximum of 512 A100 GPUs. We observed good scaling for 409634096^3 grid with 64 to 512 GPUs. We report that the timings of multicore FFT of 153631536^3 grid with 196608 cores of Cray XC40 is comparable to that of GPU-FFT of 204832048^3 grid with 128 GPUs. The efficiency of GPU-FFT is due to the fast computation capabilities of A100 card and efficient communication via NVlink.

Keywords

Cite

@article{arxiv.2202.12756,
  title  = {Scalable Multi-node Fast Fourier Transform on GPUs},
  author = {Manthan Verma and Soumyadeep Chatterjee and Gaurav Garg and Bharatkumar Sharma and Nishant Arya and Shashi Kumar and Anish Saxena and Mahendra K. Verma},
  journal= {arXiv preprint arXiv:2202.12756},
  year   = {2022}
}

Comments

10 pages, 5 figures

R2 v1 2026-06-24T09:54:00.584Z