Performance analysis of FFT algorithms on multiprocessor systems
A decimation-in-time radix-2 fast fourier transform (FFT) algorithm is considered for implementation in multiprocessors with shared bus, multistage interconnection network (MIN), and in mesh connected computers. Results are derived for data allocation, interprocessor communication, approximate computation time, and speedup of an n point FFT on any p available processing elements (PES). Further generalization is obtained for a radix-r FFT algorithm. An n*n point two-dimensional discrete fourier transform (DFT) implementation is also considered when one or more rows of the input data matrix are allocated to each pe. A performance comparison is carried out mainly between a shared bus multiprocessor and a computer with multistage interconnection network. It is shown that the latter gives much higher speedup for p>16 and is more cost effective even with the high cost of switches. N, p and r, considered here, are all powers of two. 14 references.
- Research Organization:
- Wayne State Univ., Detroit, MI
- OSTI ID:
- 5170487
- Journal Information:
- IEEE Trans. Software Eng.; (United States), Journal Name: IEEE Trans. Software Eng.; (United States) Vol. 4; ISSN IESED
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computing the two dimensional fast Fourier transform on a general purpose mesh connected multiprocessor
Multiprocessor FFT methods