A parallel 3-D FFT algorithm on clusters of vector SMPs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1947, Issue , 2001, Pages 316-323

  Takahashi, Daisuke ^a  

^a SAITAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FAST FOURIER TRANSFORMS; SHAPE MEMORY EFFECT;

FAST FOURIER TRANSFORM ALGORITHM; FFT ALGORITHM; HITACHI; POWER-OF-TWO; SYMMETRIC MULTI-PROCESSORS;

CLUSTERING ALGORITHMS;

EID: 0012776293     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70734-4     Document Type: Conference Paper

References (15)

1. J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comput., vol. 19, pp. 297-301, 1965.
2. A. Brass and G. S. Pawley, Two and three dimensional FFTs on highly parallel computers, Parallel Computing, vol. 3, pp. 167-184, 1986.
3. R. C. Agarwal, F. G. Gustavson, and M. Zubair, An efficient parallel algorithm for the 3-D FFT NAS parallel benchmark, in Proceedings of the Scalable High-Performance Computing Conference, May 23-25, 1994, Knoxville, Tennessee, pp. 129-133, IEEE Computer Society Press, 1994.
4. M. Hegland, Real and complex fast Fourier transforms on the Fujitsu VPP 500, Parallel Computing, vol. 22, pp. 539-553, 1996.
5. C. Calvin, Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication, Parallel Computing, vol. 22, pp. 1255-1279, 1996.
6. IBM Corporation, Parallel Engineering and Scientific Subroutine Library Version 2 Release 1.2 Guide and Reference (SA22-7273), 3rd ed., 1999.
7. C. Van Loan, Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia, PA, 1992.
8. M. Hegland, An implementation of multiple and multi-variate Fourier transforms on vector processors, SIAM J. Sci. Comput., vol. 16, pp. 271-288, 1995.
9. K. Nakazawa, H. Nakamura, T. Boku, I. Nakata, and Y. Yamashita, CP-PACS: A massively parallel processor at the University of Tsukuba, Parallel Computing, vol. 25, pp. 1635-1661, 1999.
10. P. N. Swarztrauber, Multiprocessor FFTs, Parallel Computing, vol. 5, pp. 197-210, 1987.
11. D. H. Bailey, FFTs in external or hierarchical memory, The Journal of Supercomputing, vol. 4, pp. 23-35, 1990.
12. K. R. Wadleigh, G. B. Gostin, and J. Liu, High-performance FFT algorithms for the Convex C4/XA supercomputer, The Journal of Supercomputing, vol. 9, pp. 163-178, 1995.
13. P. N. Swarztrauber, FFT algorithms for vector computers, Parallel Computing, vol. 1, pp. 45-63, 1984.
14. S. Goedecker, Fast radix 2, 3, 4, and 5 kernels for fast Fourier transformations on computers with overlapping multiply-add instructions, SIAM J. Sci. Comput., vol. 18, pp. 1605-1611, 1997.
15. C. Temperton, A generalized prime factor FFT algorithm for any N = 2p3q5r, SIAM J. Sci. Stat. Comput., vol. 13, pp. 676-686, 1992.