A parallel FFT on an MIMD machine

Amir Averbuch; Eran Gabber; Boaz Gordissky; Yoav Medan

doi:10.1016/0167-8191(90)90031-4

A parallel FFT on an MIMD machine

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

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	61-74
Number of pages	14
Journal	Parallel Computing
Volume	15
Issue number	1-3
DOIs	https://doi.org/10.1016/0167-8191(90)90031-4
State	Published - Sep 1990

Keywords

Parallel FFT
Parallel algorithm
Shared-memory MIMD machine

Access to Document

10.1016/0167-8191(90)90031-4

Cite this

@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",

}

TY - JOUR

T1 - A parallel FFT on an MIMD machine

AU - Averbuch, Amir

AU - Gabber, Eran

AU - Gordissky, Boaz

AU - Medan, Yoav

N1 - 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.

PY - 1990/9

Y1 - 1990/9

N2 - 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.

AB - 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.

KW - Parallel FFT

KW - Parallel algorithm

KW - Shared-memory MIMD machine

UR - http://www.scopus.com/inward/record.url?scp=0025491614&partnerID=8YFLogxK

U2 - 10.1016/0167-8191(90)90031-4

DO - 10.1016/0167-8191(90)90031-4

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0025491614

SN - 0167-8191

VL - 15

SP - 61

EP - 74

JO - Parallel Computing

JF - Parallel Computing

IS - 1-3

ER -

A parallel FFT on an MIMD machine

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this