High-performance parallel FFT algorithms for the HITACHI SR8000
Author:
- 1 January 2000
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 192-199 vol.1
Abstract
We propose high-performance parallel one-dimensional fast Fourier transform (FFT) algorithms for distributed memory parallel computers with vector symmetric multiprocessor (SMP) nodes. The four-step FFT algorithm can be altered into a five-step FFT algorithm to expand the innermost loop length. We use the four-step and five-step algorithms to implement the parallel one-dimensional FFT algorithms. In our proposed parallel FFT algorithms, since we use cyclic distribution, all-to-all communication takes place only once. Moreover, the input data and output data are both in natural order. Performance results of one-dimensional power-of-two FFTs on a distributed memory parallel computer with (pseudo) vector SMP nodes, HITACHI SR8000, are reported. We succeeded in obtaining performance of about 38 GFLOPS on a 16-node SR8000.Keywords
This publication has 13 references indexed in Scilit:
- The Future Fast Fourier Transform?SIAM Journal on Scientific Computing, 1998
- Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add InstructionsSIAM Journal on Scientific Computing, 1997
- Real and complex fast Fourier transforms on the Fujitsu VPP 500Parallel Computing, 1996
- High-performance FFT algorithms for the Convex C4/XA supercomputerThe Journal of Supercomputing, 1995
- A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $SIAM Journal on Scientific and Statistical Computing, 1992
- Computational Frameworks for the Fast Fourier Transform1992
- Multiprocessor FFTsParallel Computing, 1987
- FFT algorithms for vector computersParallel Computing, 1984
- What is the fast Fourier transform?IEEE Transactions on Audio and Electroacoustics, 1967
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965