A parallel FFT on an MIMD machine

DOI10.1016/0167-8191(90)90031-4MaRDI QIDQ919788zbMATH OpenOpenAlexFDO

Authors Eran Gabber, Boaz Gordissky, Yoav Medan, Amir Averbuch

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90031-4

zbMATH Keywords

1-dimensional discrete Fourier transformfast Fourier transformNumerical testsparallel FFT-algorithmshared-memory MIMD machine

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Review text

For the 1-dimensional discrete Fourier transform (DFT) of mixed-radix length and a 1-dimensional ``shifted DFT of radix-2 length, parallel versions of known fast algorithms are described. These algorithms are implemented on a shared-memory MIMD (non-vector) machine. Numerical tests of this parallel FFT of length \(2^ t\) (8\(\leq t\leq 16)\) are analyzed.

Recommendations

• scientific article; zbMATH DE number 3997125
• Parallel FFT algorithms for mimd computers
• scientific article; zbMATH DE number 1131691
• scientific article; zbMATH DE number 991433
• Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures

Cited in

(17)

• A general purpose subroutine for Fast Fourier Transform on a distributed memory parallel machine
• Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique
• Parallel implementation of 3D FFT with volumetric decomposition schemes for efficient molecular dynamics simulations
• Parallel FFT algorithms for mimd computers
• scientific article; zbMATH DE number 3845037 (Why is no real title available?)
• Portable parallel FFT for MIMD multiprocessors
• scientific article; zbMATH DE number 1131691 (Why is no real title available?)
• A PARALLEL FAST FOURIER TRANSFORM
• Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
• scientific article; zbMATH DE number 3999246 (Why is no real title available?)
• An Implementation of Multiple and Multivariate Fourier Transforms on Vector Processors
• PERFORMANCE ANALYSIS OF A PARALLEL FFT ALGORITHM ON A TRANSPUTER NETWORK
• scientific article; zbMATH DE number 833642 (Why is no real title available?)
• scientific article; zbMATH DE number 833643 (Why is no real title available?)
• Superparallel FFTs
• Scalable parallel FFT for spectral simulations on a Beowulf cluster
• A multiple single-board-computer parallel processing system for speed-up of FFT implementation

This page was built for publication: A parallel FFT on an MIMD machine

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