A Practical Performance Comparison of Two Parallel Fast Fourier Transform Algorithms on Cluster of PCs
Kalim Qureshi, Haroon Rashid · IEEJ Transactions on Electronics Information and Systems · 2004
In this paper, we present the performance analysis of two parallel Fast Fourier Transform algorithms, binary-exchange and transpose algorithms. These two algorithms were implemented and tested on a cluster of PCs using Message Passing Interface (MPI). The binary-exchange algorithm implementation was showing less processing and communication time than transpose algorithm.