@article{b31f0a6685404006a6039b278b3f325d,
title = "A parallel FFT on an MIMD machine",
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.",
keywords = "Parallel FFT, Parallel algorithm, Shared-memory MIMD machine",
author = "Amir Averbuch and Eran Gabber and Boaz Gordissky and Yoav Medan",
note = "Funding Information: * This work was supported by the Basic Research Foundation administered by the Israeli Academy of Sciences and part by a research grant from National Semiconductor, Israel. Short version of the paper appeared in the 1989 International Coneference on Parallel Processing, pp. 111-63-Ill-70, August 8-12, 1989, Chicago.",
year = "1990",
month = sep,
doi = "10.1016/0167-8191(90)90031-4",
language = "אנגלית",
volume = "15",
pages = "61--74",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "1-3",
}