Adaptive routing in mesh-connected networks
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topologies. Previous routing algorithms for meshes have been either deadlock free and nonadaptive or deadlock free and adaptive at the expense of adding physical or virtual channels. Our model for designing adaptive, deadlock-free routing algorithms is based on analyzing the directions in which packets can turn in a mesh. Prohibiting just a quarter of the turns in a 2D or...Keywords
This publication has 6 references indexed in Scilit:
- High Performance Communications In Processor NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The Turn Model for Adaptive RoutingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- 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
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- The torus routing chipDistributed Computing, 1986