Optimal routing algorithm and the diameter of the cube-connected cycles
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 4 (10) , 1172-1178
- https://doi.org/10.1109/71.246078
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On the Construction of Fault-Tolerant Cube-Connected Cycles NetworksJournal of Parallel and Distributed Computing, 1995
- Adapting shuffle-exchange like parallel processing organizations to work as systolic arraysParallel Computing, 1989
- Evaluation of On-Chip Static Interconnection NetworksIEEE Transactions on Computers, 1987
- Dictionary Machines on Cube-Class NetworksIEEE Transactions on Computers, 1987
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Communication Structures for Large Networks of MicrocomputersIEEE Transactions on Computers, 1981