DocumentCode :
1885637
Title :
An efficient parallel algorithm for the 3-D FFT NAS parallel benchmark
Author :
Agarwal, R.C. ; Gustavson, F.G. ; Zubair, M.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear :
1994
fDate :
23-25 May 1994
Firstpage :
129
Lastpage :
133
Abstract :
We propose an efficient algorithm to implement the 3D NAS FFT benchmark. The proposed algorithm overlaps the communication with the computation. On parallel machines supporting overlap of communication with computation, the proposed algorithm can outperform the non-overlapping version of this algorithm by a factor close to two
Keywords :
computer testing; fast Fourier transforms; parallel algorithms; parallel machines; parallel programming; performance evaluation; program testing; 3-D FFT NAS parallel benchmark; 3D NAS FFT benchmark; non-overlapping version; parallel algorithm; parallel machines; Concurrent computing; Data structures; Discrete Fourier transforms; NASA; Parallel algorithms; Parallel machines; Partial differential equations; Phased arrays; Reduced instruction set computing; Supercomputers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Scalable High-Performance Computing Conference, 1994., Proceedings of the
Conference_Location :
Knoxville, TN
Print_ISBN :
0-8186-5680-8
Type :
conf
DOI :
10.1109/SHPCC.1994.296635
Filename :
296635
Link To Document :
بازگشت