An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 40 (1) , 2-12
- https://doi.org/10.1109/12.67315
Abstract
The concept of virtual channels is extended to multiple virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible, and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free routing are examined for three k-ary n-cube topologies: unidirectional, torus-connected bidirectional, and mesh-connected bidirectional.Keywords
This publication has 8 references indexed in Scilit:
- A Framework for Adaptive RoutingPublished by Defense Technical Information Center (DTIC) ,1987
- The Connection MachineScientific American, 1987
- Time-Stamp Approach to Store-and-Forward Deadlock PreventionIEEE Transactions on Communications, 1987
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- Prevention of Store-and-Forward Deadlock in Computer NetworksIEEE Transactions on Communications, 1985
- The cosmic cubeCommunications of the ACM, 1985
- Deadlock-Free Packet Switching NetworksSIAM Journal on Computing, 1981
- Prevention of Deadlocks in Packet-Switched Data Transport SystemsIEEE Transactions on Communications, 1981