A High-Performance FFT Algorithm for Vector Supercomputers
- 1 March 1988
- journal article
- other
- Published by SAGE Publications in The International Journal of Supercomputing Applications
- Vol. 2 (1) , 82-87
- https://doi.org/10.1177/109434208800200106
Abstract
Many traditional algorithms for computing the fast Fourier transform (FFT) on conventional computers are unacceptable for advanced vector and parallel computers because they involve nonunit, power-of-two memory strides. This paper presents a practical technique for computing the FFT that avoids all such strides and ap pears to be near-optimal for a variety of current vector and parallel computers. Performance results of a pro gram based on this technique are presented. Notable among these results is that a Fortran implementation of this algorithm on the CRAY-2 runs up to 77% faster than Cray's assembly-coded library routine.Keywords
This publication has 5 references indexed in Scilit:
- Multiprocessor FFTsParallel Computing, 1987
- A high-performance fast Fourier transform algorithm for the Cray-2The Journal of Supercomputing, 1987
- FFT algorithms for vector computersParallel Computing, 1984
- A vector implementation of the Fast Fourier Transform algorithmMathematics of Computation, 1981
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968