Optimal Fully Adaptive Minimal Wormhole Routing for Meshes

  title={Optimal Fully Adaptive Minimal Wormhole Routing for Meshes},
  author={Loren Schwiebert and D. N. Jayasimha},
  journal={J. Parallel Distrib. Comput.},
A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm with uniform routers that achieves both of these goals. This new algorithm requires only 4n 2 virtual channels for an n-dimensional mesh. In addition, if more than the… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 23 extracted citations

NoC routing protocols - objective-based classification

Journal of Systems Architecture - Embedded Systems Design • 2016
View 6 Excerpts
Highly Influenced

Time-Division-Multiplexer based routing algorithm for NoC system

2013 IEEE International Symposium on Circuits and Systems (ISCAS2013) • 2013
View 1 Excerpt

A Dynamically Adjusting Gracefully Degrading Link-Level Fault-Tolerant Mechanism for NoCs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems • 2012
View 2 Excerpts

A traffic-blanced adaptive routing in 2D torus based on odd-even turn model

2009 IEEE International Conference on Network Infrastructure and Digital Content • 2009
View 2 Excerpts


Publications referenced by this paper.
Showing 1-10 of 11 references

Similar Papers

Loading similar papers…