Communication algorithms in k-ary n-cube interconnection networks
- 14 January 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 61 (1) , 43-48
- https://doi.org/10.1016/s0020-0190(96)00188-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Lee distance and topological properties of k-ary n-cubesIEEE Transactions on Computers, 1995
- Unicast-based multicast communication in wormhole-routed networksIEEE Transactions on Parallel and Distributed Systems, 1994
- A survey of wormhole routing techniques in direct networksComputer, 1993
- Complexity analysis of broadcasting in hypercubes with restricted communication capabilitiesJournal of Parallel and Distributed Computing, 1992
- Optimal communication algorithms for hypercubesJournal of Parallel and Distributed Computing, 1991
- An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubesIEEE Transactions on Computers, 1991
- Performance analysis of k-ary n-cube interconnection networksIEEE Transactions on Computers, 1990
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- Generalized Hypercube and Hyperbus Structures for a Computer NetworkIEEE Transactions on Computers, 1984