A Cost-Effective Load Balanced Adaptive Routing Scheme for Mesh-Connected Networks

Abstract

In this paper a highly cost-effective adaptive routing algorithm for n-D meshes is designed. It employs only two virtual channels. The planar routing and the 2D VBMAR are used as constructs for it. Routing freedom is greatly enhanced to improve performance. As a result, the algorithm features load balance and high adaptivity. Deadlock freedom of the algorithm is proved. Extensive simulations show that it not only outperforms algorithms with equal virtual channels, but also excels the fully routing algorithm with much more virtual channels. Key Words: Adaptive routing, VBMAR, Crossed turn model, Load balance, Deadlock freedom, Virtual channel, Network performance 1

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://citeseerx.ist.psu.edu/v... (external link)

http://www.ccsr.cam.ac.uk/tech... (external link)