Abstract
One of the many interesting architectural features of the CRAY-2 supercomputer is that each processor has access to 16K 64-bit words of local memory. This is in addition to the extremely large, 268-million-word common memory that is accessible by all four processors. By using local memory judiciously, it is possible to achieve increased performance on the CRAY-2. This is partly because accesses to local memory can be done simultaneously with accesses to common memory and other operations. Also, it is slightly faster to start up a vector access to local memory, and a processor does not have to compete with other processors when accessing its local memory. In this paper, we present an algorithm for computing the fast Fourier transform that takes advantage of the CRAY-2's local memory. It operates by solving subproblems, which are themselves Fourier transforms, entirely within local memory. By doing so it achieves a performance increase of between 25 and 40 percent over an equivalent algorithm that uses only common memory, and for some input sizes is able to outperform the CRAY-2 library FFT.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agarwal, R. 1987. An efficient formulation of the mixed-radix FFT algorithm. IBM T.J. Watson Research Center Tech. Rept.
Aggarwal, A., and Vitter, J.S. 1988. The input/output complexity of sorting and related problems. CACM, 31, 9 (Sept.), 1116–1127.
Armstrong, J. 1988. A multi-algorithm approach to very high performance one-dimensional FFTs. The J. Supercomputing, 2, 4 (Dec.), 415–433.
Bailey, D. 1987. A high-performance fast Fourier transform algorithm for the CRAY-2. The J. Supercomputing, 1, 1: 43–60.
Bailey, D. 1988. A high-performance FFT algorithm for vector supercomputers: Internat. J. Supercomputer Applications, 2: 82–87.
Brigham, E. 1974. The Fast Fourier Transform. Prentice-Hall, Englewood Cliffs, N.J.
Cochran, W.T., Cooley, J.W., Favin, D.L., Helms, H.D., Kaenel, R.A., Lang, W.W., Maling, G.C., Jr., Nelson, D.E., Rader, C.M., and Welch, P.D. 1967. What is the fast Fourier transform? IEEE Trans. Audio Electroacoustics, AU-15: 45–55.
Cooley, J.W., and Tukey, J.W. 1965. An algorithm for the machine calculation of complex Fourier series. Math. Comp. 19: 297–301.
Fornberg, B. 1981. A vector implementation of the fast Fourier transform algorithm. Math. Comp., 36: 189–191.
Hong, J.-W., and Kung, H.T. 1981. I/O complexity: The red-blue pebble game. Proc., 13th ACM Symp. on Theory of Computing, pp. 326–333.
Pease, M.C. 1968. An adaptation of the fast Fourier transform for parallel processing. JACM, 15: 252–264.
Savage, J.E., and Swamy, S. 1978. Space-time tradeoffs on the FFT algorithm. IEEE Trans. Inf. Theory, IT-24: 563–568.
Swarztrauber, P.N. 1984. FFT algorithms for vector computers. Parallel Computing, 1: 45–63.
Swarztrauber, P.N. 1987. Multiprocessor FFTs. Parallel Computing, 5: 197–210.
Temperton, C. 1983. Self-sorting, mixed-radix fast Fourier transforms. J. Comp. Physics, 52: 1–23.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Carlson, D.A. Using local memory to boost the performance of FFT algorithms on the CRAY-2 supercomputer. J Supercomput 4, 345–356 (1991). https://doi.org/10.1007/BF00129835
Issue Date:
DOI: https://doi.org/10.1007/BF00129835