A Parallel 3-D FFT Algorithm on Clusters of Vector SMPs
- 10 April 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 316-323
- https://doi.org/10.1007/3-540-70734-4_37
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An efficient parallel algorithm for the 3-D FFT NAS parallel benchmarkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- CP-PACS: A massively parallel processor at the University of TsukubaParallel Computing, 1999
- Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communicationParallel Computing, 1996
- Real and complex fast Fourier transforms on the Fujitsu VPP 500Parallel Computing, 1996
- An Implementation of Multiple and Multivariate Fourier Transforms on Vector ProcessorsSIAM Journal on Scientific Computing, 1995
- Computational Frameworks for the Fast Fourier TransformPublished by Society for Industrial & Applied Mathematics (SIAM) ,1992
- FFTs in external or hierarchical memoryThe Journal of Supercomputing, 1990
- Multiprocessor FFTsParallel Computing, 1987
- Two and three dimensional FFTs on highly parallel computersParallel Computing, 1986
- An Algorithm for the Machine Calculation of Complex Fourier SeriesMathematics of Computation, 1965