High performance FFT algorithms for cache-coherent multiprocessors

International Journal of High Performance Computing Applications

Volumn 13, Issue 2, 1999, Pages 163-171

  Wadleigh, Kevin R ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; FAST FOURIER TRANSFORMS; PARALLEL ALGORITHMS;

CACHE-COHERENT MULTIPROCESSORS;

MULTIPROCESSING SYSTEMS;

EID: 0032648049     PISSN: 10943420     EISSN: None     Source Type: Journal    
DOI: 10.1177/109434209901300206     Document Type: Article

References (7)

1. Bailey, D. 1987. A high performance fast Fourier transform algorithm for the Cray-2. J. Supercomputing 1:43-60.
2. Bailey, D. 1988. A high performance FFT algorithm for vector supercomputers. Int. J. Supercomputer Applications 2:82-87.
3. Bailey, D. 1990. FFTs in external or hierarchial memory. J. Supercomputing 4:23-35.
4. Cochrane, W. T., Cooley, J. W., Favin, J. W., Helms, D. L., Kaenel, R. A., Lang, W. W., Maling, G. C., Nelson, D. E., Rader, C. M., and Welch, P. D. 1967. What is the fast Fourier transform? IEEE Trans. Audio and Electroacoustics AU-15:45-55.
5. Cooley, J. W., and Tukey, J. W. 1965. An algorithm for the machine calculation of complex Fourier series. Math. Comp. 19:297-301.
6. Goedecker, S. 1997. Fast radix 2,3,4, and 5 kernels for fast Fourier transformations on computers with overlapping multiply-add instructions. SIAM J. Sci. Comput. 18:1605-1611.
7. Wadleigh, K., Gostin, G., and Liu, J. 1995. High performance FFT algorithms for the Convex C4/XA supercomputer. J. Supercomputing 9: 163-178.