swMATH ID: 7582
Software Authors: Pippig, Michael
Description: PFFT: An extension of FFTW to massively parallel architectures. We present an MPI based software library for computing fast Fourier transforms (FFTs) on massively parallel, distributed memory architectures based on the message passing interface standard (MPI). Similar to established transpose FFT algorithms, we propose a parallel FFT framework that is based on a combination of local FFTs, local data permutations, and global data transpositions. This framework can be generalized to arbitrary multidimensional data and process meshes. All performance-relevant building blocks can be implemented with the help of the FFTW software library. Therefore, our library offers great flexibility and portable performance. Similarly to FFTW, we are able to compute FFTs of complex data, real data, and even- or odd-symmetric real data. All the transforms can be performed completely in place. Furthermore, we propose an algorithm to calculate pruned FFTs more efficiently on distributed memory architectures. For example, we provide performance measurements of FFTs of sizes between \(512^3\) and \(8192^3\) up to 262144 cores on a BlueGene/P architecture, up to 32768 cores on a BlueGene/Q architecture, and up to 4096 cores on the J”ulich Research on Petaflop Architectures (JuRoPA).
Homepage: http://www-user.tu-chemnitz.de/~mpip/paper/PFFT.pdf
Keywords: parallel fast Fourier transform; numerical examples; MPI based software library; message passing interface standard; algorithm; FFTW software library; performance measurements
Related Software: FFTW; 2DECOMP; P3DFFT; PETSc; PNFFT; PoisFFT; GitHub; NFFT3; ScaFaCoS; cuFFT; AccFFT; Python; CaNS; PPM; p4est; NFFT; MPI; CUBLAS; CUSPARSE; CUDA
Cited in: 18 Publications

Standard Articles

1 Publication describing the Software, including 1 Publication in zbMATH Year
PFFT: An extension of FFTW to massively parallel architectures. Zbl 1275.65098
Pippig, Michael

Citations by Year