By Topic

An efficient parallel algorithm for the 3-D FFT NAS parallel benchmark

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Agarwal, R.C. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Gustavson, F.G. ; Zubair, M.

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

Published in:

Scalable High-Performance Computing Conference, 1994., Proceedings of the

Date of Conference:

23-25 May 1994