Ordered fast fourier transforms on a massively parallel hypercube multiprocessor
- 1 May 1991
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 12 (1) , 50-59
- https://doi.org/10.1016/0743-7315(91)90028-8
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An algorithm for the fast Fourier transform on a Connection MachineComputers in Physics, 1990
- 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
- Communication efficient basic linear algebra computations on hypercube architecturesJournal of Parallel and Distributed Computing, 1987
- FFT algorithms for vector computersParallel Computing, 1984
- A Unified Approach to a Class of Data Movements on an Array ProcessorIEEE Transactions on Computers, 1982
- Optimal BPC Permutations on a Cube Connected SIMD ComputerIEEE Transactions on Computers, 1982
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980
- Array Permutation by Index-Digit PermutationJournal of the ACM, 1976