Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication
- 1 November 1996
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 22 (9) , 1255-1279
- https://doi.org/10.1016/s0167-8191(96)00039-7
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The scalability of FFT on parallel computersIEEE Transactions on Parallel and Distributed Systems, 1993
- Cooley-Tukey FFT on the Connection MachineParallel Computing, 1992
- A parallel FFT on an MIMD machineParallel Computing, 1990
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Data communication in parallel architecturesParallel Computing, 1989
- Gray codes, Fast Fourier Transforms and hypercubesParallel Computing, 1988
- A segmented FFT algorithm for vector computersParallel Computing, 1988
- Multiprocessor FFTsParallel Computing, 1987
- Two and three dimensional FFTs on highly parallel computersParallel Computing, 1986
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965