A distributed implementation of fast Fourier transform on indirect swap networks
S.G. Abraham, Sajib Barua, Parimala Thulasiraman, Ruppa K. Thulasiram · 2004
Efficient data distribution is important to overcome latencies in distributed memory multiprocessors. In this paper we have studied the distributed implementation of the FFT algorithm using the ISN topology to improve data locality. The algorithm is implemented on the Beowulf clusters using MPI. We obtain 20% better performance compared to the butterfly network.