Using local memory to boost the performance of FFT algorithms on the CRAY-2 supercomputer
- 1 January 1991
- journal article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 4 (4), 345-356
- https://doi.org/10.1007/bf00129835
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A multi-algorithm approach to very high performance one-dimensional FFTsThe Journal of Supercomputing, 1988
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- A High-Performance FFT Algorithm for Vector SupercomputersThe International Journal of Supercomputing Applications, 1988
- 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
- Space-time trade-offs on the FFT algorithmIEEE Transactions on Information Theory, 1978
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968
- 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