Efficient parallel algorithm for the 3-D FFT NAS parallel benchmark

Abstract

In this paper we propose an efficient algorithm to implement the 3-D NAS FFT benchmark. The proposed algorithm overlaps the communication with the computation. On parallel machines supporting overlap of communication with computation, our proposed algorithm can outperform the non-overlapping version of this algorithm by a factor close to two.