DocumentCode
397073
Title
A distributed implementation of fast Fourier transform on indirect swap networks
Author
Abraham, Shony ; Barua, Simul ; Thulasiraman, Parimala ; Thulasiram, Ruppa K.
Author_Institution
Dept. of Electr. & Comput. Eng., Manitoba Univ., Winnipeg, Man., Canada
Volume
2
fYear
2003
fDate
4-7 May 2003
Firstpage
1147
Abstract
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.
Keywords
distributed memory systems; fast Fourier transforms; parallel architectures; Beowulf clusters; FFT algorithm; ISN topology; butterfly network; data distribution; distributed implementation; distributed memory multiprocessors; fast Fourier transform; indirect swap networks; Algorithm design and analysis; Clustering algorithms; Computer science; Delay; Fast Fourier transforms; Frequency diversity; Frequency synchronization; Network topology; Parallel architectures; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 2003. IEEE CCECE 2003. Canadian Conference on
ISSN
0840-7789
Print_ISBN
0-7803-7781-8
Type
conf
DOI
10.1109/CCECE.2003.1226100
Filename
1226100
Link To Document