Fault diameter of k-ary n-cube networks
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 8 (9) , 903-907
- https://doi.org/10.1109/71.615436
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Lee distance and topological properties of k-ary n-cubesIEEE Transactions on Computers, 1995
- Adaptive deadlock- and livelock-free routing with all minimal paths in torus networksIEEE Transactions on Parallel and Distributed Systems, 1994
- The cost of broadcasting on star graphs and k-ary hypercubesIEEE Transactions on Computers, 1993
- Combinatorial analysis of the fault-diameter of the n-cubeIEEE Transactions on Computers, 1993
- An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubesIEEE Transactions on Computers, 1991
- A new hierarchy of hypercube interconnection schemes for parallel computersThe Journal of Supercomputing, 1988
- Topological properties of hypercubesIEEE Transactions on Computers, 1988
- Fault diameter of interconnection networksComputers & Mathematics with Applications, 1987
- The torus routing chipDistributed Computing, 1986
- Generalized Hypercube and Hyperbus Structures for a Computer NetworkIEEE Transactions on Computers, 1984