A simple and efficient parallel FFT algorithm using the BSP model

DOI10.1016/S0167-8191(01)00118-1MaRDI QIDQ5958606zbMATH OpenOpenAlexFDO

Authors Márcia A. Inda, R. H. Bisseling

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)

Recommendations

• FFT algorithms and their adaptation to parallel processing
• Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
• High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers
• A parallel FFT algorithm for transputer networks
• scientific article; zbMATH DE number 3997125

Cited in

(7)

• A parallel-in-time implementation of the Numerov method for wave equations
• Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique
• 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
• Acceleration of the Two-Level MGRIT Algorithm via the Diagonalization Technique
• Minimizing Communication in the Multidimensional FFT

Describes a project that uses

Uses Software

• BSPlib

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958606)