A high performance parallel algorithm for 1-D FFT
- IBM T.J. Watson Research Center, Yorktown Heights, NY (United States)
In this paper the authors propose a parallel high performance FFT algorithm based on a multi-dimensional formulation. They use this to solve a commonly encountered FFT based kernel on a distributed memory parallel machine, the IBM scalable parallel system, SP1. The kernel requires a forward FFT computation of an input sequence, multiplication of the transformed data by a coefficient array, and finally an inverse FFT computation of the resultant data. They show that the multi-dimensional formulation helps in reducing the communication costs and also improves the single node performance by effectively utilizing the memory system of the node. They implemented this kernel on the IBM SP1 and observed a performance of 1.25 GFLOPS on a 64-node machine.
- OSTI ID:
- 87608
- Report Number(s):
- CONF-941118-; ISBN 0-8186-6605-6; TRN: IM9535%%239
- Resource Relation:
- Conference: Supercomputing `94 meeting, Washington, DC (United States), 14-18 Nov 1994; Other Information: PBD: 1994; Related Information: Is Part Of Supercomputing `94: Proceedings; PB: 849 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
DANTSYS/MPI: a system for 3-D deterministic transport on parallel architectures
fftMPI, a library for performing 2d and 3d FFTs in parallel