Minimizing Communication in the Multidimensional FFT

DOI10.1137/22m1487242arXiv2203.11795OpenAlexW4389486751MaRDI QIDQ6141725

Unnamed Author, Rob H. Bisseling

Publication date: 20 December 2023

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.11795

zbMATH Keywords

MPIcyclic distributionBSPmultidimensional FFTparallel fast Fourier transform3D FFTall-to-all

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• A comparison of different propagation schemes for the time dependent Schrödinger equation
• Parallel implementation of 3D FFT with volumetric decomposition schemes for efficient molecular dynamics simulations
• On the Efficient Parallel Computation of Legendre Transforms
• PFFT: An Extension of FFTW to Massively Parallel Architectures
• P3DFFT: A Framework for Parallel Computations of Fourier Transforms in Three Dimensions
• Parallel Algorithms for the Spectral Transform Method
• ScaLAPACK Users' Guide
• Parallel Scientific Computation
• A Flexible Framework for Multidimensional DFTs
• An Algorithm for the Machine Calculation of Complex Fourier Series
• A simple and efficient parallel FFT algorithm using the BSP model

This page was built for publication: Minimizing Communication in the Multidimensional FFT