A parallel FFT on an MIMD machine

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


In this paper we present a parallelization of the Cooley- Tukey FFT algorithm that is implemented on a shared-memory MIMD (non-vector) machine that was built in the Dept. of Computer Science, Tel Aviv University. A parallel algorithm is presented for one dimension Fourier transform with performance analysis. For a large array of complex numbers to be transformed, an almost linear speed-up 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)61-74
Number of pages14
JournalParallel Computing
Issue number1-3
StatePublished - Sep 1990


  • Parallel FFT
  • Parallel algorithm
  • Shared-memory MIMD machine


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

Cite this