论文信息 - FFT Implementations on nCUBE Multiprocessor

FFT Implementations on nCUBE Multiprocessor

Three parallel FFT algorithms have been implemented on an nCUBE multiprocessor a nd their performances have been analyzed. We have also developed a communicatio n and computation model for the nCUBE system based on measurements. This model is then used to predict the execution time and communication time for the three FFT algorithms. These predictions have been verified with the execution of thes e algorithms on the nCUBE system.

Laxmi N. Bhuyan | Akhilesh Kumar

[1] Chris R. Jesshope,et al. The Implementation of Fast Radix 2 Transforms on Array Processors , 1980, IEEE Transactions on Computers.

[2] Amir AVERBUCH,et al. A parallel FFT on an MIMD machine , 1990, Parallel Comput..

[3] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .

[4] Paul N. Swarztrauber,et al. FFT algorithms for vector computers , 1984, Parallel Comput..

[5] David H. Bailey. A High-Performance FFT Algorithm for Vector Supercomputers , 1987, PPSC.

[6] Dharma P. Agrawal,et al. Performance Analysis of FFT Algorithms on Multiprocessor Systems , 1983, IEEE Transactions on Software Engineering.

[7] Laxmi N. Bhuyan,et al. Parallel FFT Algorithms for Cache Based Shared Memory Multiprocessors , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[8] E. O. Brigham,et al. The Fast Fourier Transform , 1967, IEEE Transactions on Systems, Man, and Cybernetics.

[9] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .

[10] Susumu Horiguchi,et al. Performance Evaluation of Parallel Fast Fourier Transform on a Multiprocessor Workstation , 1991, J. Parallel Distributed Comput..

[11] Marshall C. Pease,et al. An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[12] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .