Summary: A PARALLEL FFT ON AN MIMD MACHINE \Lambda
appeared in Parallel Computing, Vol. 15, pp. 61­74, 1990
Amir Averbuch Eran Gabber Boaz Gordissky y
Yoav Medan z
y Department of Computer Science
School of Mathematical Sciences
Tel­Aviv University
Tel­Aviv 69978 Israel
z IBM Scientific Center
Nuclear Engineering Building
Technion City, Haifa 32000, Israel
E­Mail: amir@MATH.TAU.AC.IL
Abstract
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.

Source: Averbuch, Amir - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences