Parallel FFT on an MIMD machine

Amir Averbuch, Eran Gabber, Boaz Gordissky, Yoav Medan

Research output: Contribution to journalConference articlepeer-review

Abstract

A parallelization is presented of the Cooley-Tukey FFT algorithm that is implemented on a shared-memory MIMD (nonvector) machine. A parallel algorithm is presented for a one-dimensional Fourier transform with performance analysis. For a large array of complex numbers to be transformed, an almost linear speedup is demonstrated. This algorithm can be executed by any number of processors, but generally the number is much less than the length of the input data.

Original languageEnglish
Pages (from-to)63-70
Number of pages8
JournalProceedings of the International Conference on Parallel Processing
Volume3
StatePublished - 1989
EventProceedings of the 1989 International Conference on Parallel Processing - University Park, PA, USA
Duration: 8 Aug 198912 Aug 1989

Fingerprint

Dive into the research topics of 'Parallel FFT on an MIMD machine'. Together they form a unique fingerprint.

Cite this