A Parallel 3-D FFT Algorithm on Clusters of Vector SMPs

Authors:
Daisuke Takahashi
Affiliations:
-
Venue:
PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Year:
2000

Citing 11
Cited 1

Two and three dimensional FFTS on highly parallel computers

Parallel Computing
FFTs in external or hierarchical memory

The Journal of Supercomputing
Computational frameworks for the fast Fourier transform

Computational frameworks for the fast Fourier transform
A generalized prime factor FFT algorithm for any N=2p3q5r

SIAM Journal on Scientific and Statistical Computing
An implementation of multiple and multivariate Fourier transforms on vector processors

SIAM Journal on Scientific Computing
High-performance FFT algorithms for the Convex C4/XA supercomputer

The Journal of Supercomputing - Special issue: trends in parallel operating systems
Real and complex fast Fourier transforms on the Fujitsu VPP 500

Parallel Computing
Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication

Parallel Computing
Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions

SIAM Journal on Scientific Computing
CP-PACS: a massively parallel processor at the University of Tsukuba

Parallel Computing - Special Anniversary issue
FFT algorithms for vector computers

Parallel Computing

On the communication complexity of 3D FFTs and its implications for Exascale

Proceedings of the 26th ACM international conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a high-performance parallel three-dimensional fast Fourier transform (FFT) algorithm on clusters of vector symmetric multiprocessor (SMP) nodes. The three-dimensional FFT algorithm can be altered into a multirow FFT algorithm to expand the innermost loop length. We use the multirow FFT algorithm to implement the parallel three-dimensional FFT algorithm. Performance results of three-dimensional power-of-two FFTs on clusters of (pseudo) vector SMP nodes, Hitachi SR8000, are reported. We succeeded in obtaining performance of about 40 GFLOPS on a 16-node Hitachi SR8000.