Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architectures

Journal Article · Fri May 01 04:00:00 EDT 1987 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1987.1676943· OSTI ID:6595452

Norton, A; Silberger, A J

The authors present a study of parallelization of the Cooley-Tukey radix two FFT algorithm for MIMD (nonvector) architectures. Parallel algorithms are presented for one and multidimensional Fourier transforms. From instruction traces obtained by executing Fortran kernels derived from our algorithms, they determined the precise instructions to be executed by each processor in the parallel system. They used these instruction traces to predict the performance of the IBM Research Parallel Processing Prototype, RP3, as a computer of FFT's. The performance results are depicted in graphs included in this paper.

• Research Organization: IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598
• OSTI ID: 6595452
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-36:5; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
990230 -- Mathematics & Mathematical Models-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COMPUTERS
DIGITAL COMPUTERS
FOURIER TRANSFORMATION
GRAPHS
INTEGRAL TRANSFORMATIONS
MATHEMATICAL LOGIC
MEMORY DEVICES
PARALLEL PROCESSING
PERFORMANCE
PROGRAMMING
SUPERCOMPUTERS
TRANSFORMATIONS