A comparison of optimal FFTs on torus and hypercube multicomputers
- 1 May 2001
- journal article
- Published by Elsevier BV in Parallel Computing
- Vol. 27 (6), 847-859
- https://doi.org/10.1016/s0167-8191(00)00107-1
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Is an alligator better than an armadillo? [interconnection networks]IEEE Concurrency, 1997
- Design and performance of a scalable parallel community climate modelParallel Computing, 1995
- Optimal communication channel utilization for matrix transposition and related permutations on binary cubesDiscrete Applied Mathematics, 1994
- Index transformation algorithms in a linear algebra frameworkIEEE Transactions on Parallel and Distributed Systems, 1994
- Supporting the hypercube programming model on mesh architecturesPublished by Association for Computing Machinery (ACM) ,1992
- Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communicationJournal of Parallel and Distributed Computing, 1991
- Optimal communication algorithms for hypercubesJournal of Parallel and Distributed Computing, 1991
- Intensive hypercube communication Prearranged communication in link-bound machinesJournal of Parallel and Distributed Computing, 1990
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Multiprocessor FFTsParallel Computing, 1987