A simple and efficient parallel FFT algorithm using the BSP model

DOI10.1016/S0167-8191(01)00118-1zbMath0983.68248OpenAlexW2164100266MaRDI QIDQ5958606

Rob H. Bisseling, Márcia A. Inda

Publication date: 3 March 2002

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(01)00118-1

zbMATH Keywords

BSP modelparallel radix-4 FFT algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (7)

Minimizing Communication in the Multidimensional FFT ⋮ A Diagonalization-Based Parareal Algorithm for Dissipative and Wave Propagation Problems ⋮ A Flexible Framework for Multidimensional DFTs ⋮ A Parallel-in-Time Algorithm for High-Order BDF Methods for Diffusion and Subdiffusion Equations ⋮ A parallel-in-time implementation of the Numerov method for wave equations ⋮ Acceleration of the Two-Level MGRIT Algorithm via the Diagonalization Technique ⋮ Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique

Uses Software

• BSPlib

This page was built for publication: A simple and efficient parallel FFT algorithm using the BSP model