Efficient communication primitives on hypercubes
- 1 September 1992
- journal article
- Published by Wiley in Concurrency: Practice and Experience
- Vol. 4 (6), 427-457
- https://doi.org/10.1002/cpe.4330040603
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- 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
- Benchmarking the iPSC/2 hypercube multiprocessorConcurrency: Practice and Experience, 1989
- Gaussian elimination on a hypercube automatonJournal of Parallel and Distributed Computing, 1987
- Communication efficient basic linear algebra computations on hypercube architecturesJournal of Parallel and Distributed Computing, 1987
- Hypercube Algorithms and ImplementationsSIAM Journal on Scientific and Statistical Computing, 1987
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977
- A large scale, homogeneous, fully distributed parallel machine, IACM SIGARCH Computer Architecture News, 1977