This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallelization and Performance Analysis of the Cooley?Tukey FFT Algorithm for Shared-Memory Architectures
May 1987 (vol. 36 no. 5)
pp. 581-591
A. Norton, IBM Thomas J. Watson Research Center
We present here 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, we determined the precise instructions to be executed by each processor in the parallel system. We used these instruction races to predict the performance of the IBM Research Parallel Processing Prototype, RP3, as a computer of FFT's. Our performance results are depicted in graphs included in this paper.
Index Terms:
shared memory, Cooley-Tukey, fast Fourier transform, MIMD, parallelism, performance analysis
Citation:
A. Norton, A.J. Silberger, "Parallelization and Performance Analysis of the Cooley?Tukey FFT Algorithm for Shared-Memory Architectures," IEEE Transactions on Computers, vol. 36, no. 5, pp. 581-591, May 1987, doi:10.1109/TC.1987.1676943
Usage of this product signifies your acceptance of the Terms of Use.