Communication efficient multi-processor FFT
- 31 October 1992
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 102 (2) , 381-397
- https://doi.org/10.1016/0021-9991(92)90380-h
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Ordered fast fourier transforms on a massively parallel hypercube multiprocessorJournal of Parallel and Distributed Computing, 1991
- Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communicationJournal of Parallel and Distributed Computing, 1991
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble ArchitecturesSIAM Journal on Matrix Analysis and Applications, 1988
- Multiprocessor FFTsParallel Computing, 1987
- Solving Tridiagonal Systems on Ensemble ArchitecturesSIAM Journal on Scientific and Statistical Computing, 1987
- Communication efficient basic linear algebra computations on hypercube architecturesJournal of Parallel and Distributed Computing, 1987
- Array Permutation by Index-Digit PermutationJournal of the ACM, 1976
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965