 
Summary: A PARALLEL FFT ON AN MIMD MACHINE \Lambda
appeared in Parallel Computing, Vol. 15, pp. 6174, 1990
Amir Averbuch Eran Gabber Boaz Gordissky y
Yoav Medan z
y Department of Computer Science
School of Mathematical Sciences
TelAviv University
TelAviv 69978 Israel
z IBM Scientific Center
Nuclear Engineering Building
Technion City, Haifa 32000, Israel
EMail: amir@MATH.TAU.AC.IL
Abstract
In this paper we present a parallelization of the CooleyTukey FFT algorithm that
is implemented on a sharedmemory MIMD (nonvector) 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 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.
