Parallel 3-dim fast Fourier transforms with load balancing of the plane waves
From MaRDI portal
Abstract: The plane wave method is most widely used for solving the Kohn-Sham equations in first-principles materials science computations. In this procedure, the three-dimensional (3-dim) trial wave functions' fast Fourier transform (FFT) is a regular operation and one of the most demanding algorithms in terms of the scalability on a parallel machine. We propose a new partitioning algorithm for the 3-dim FFT grid to accomplish the trade-off between the communication overhead and load balancing of the plane waves. It is shown by qualitative analysis and numerical results that our approach could scale the plane wave first-principles calculations up to more nodes.
Recommendations
- P3DFFT: A framework for parallel computations of Fourier transforms in three dimensions
- Two and three dimensional FFTs on highly parallel computers
- Parallel three-dimensional nonequispaced fast Fourier transforms and their application to particle simulation
- Parallelization of fast Fourier transforms
- A PARALLEL FAST FOURIER TRANSFORM
- Flexible parallelization of fast wavelet transforms
- scientific article; zbMATH DE number 3997125
Cites work
Cited in
(3)
This page was built for publication: Parallel 3-dim fast Fourier transforms with load balancing of the plane waves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686966)