Issue No. 02 - February (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.565594
<p><b>Abstract</b>—In this paper, we analyze several issues involved in developing low latency adaptive wormhole routing schemes for two-dimensional meshes. It is observed that along with adaptivity, balanced distribution of traffic has a significant impact on the system performance. Motivated by this observation, we develop a new fully adaptive routing algorithm called <it>positive-first-negative-first</it> for two-dimensional meshes. The algorithm uses only two virtual channels per physical channel creating two virtual networks. The messages are routed positive-first in one virtual network and negative-first in the other. Because of this combination, the algorithm distributes the system load uniformly throughout the network and is also fully adaptive. It is shown that the proposed algorithm results in providing better performance in terms of the average network latency and throughput when compared with the previously proposed routing algorithms.</p>
Adaptive wormhole routing, positive-first-negative-first algorithm, region of adaptivity, traffic distribution, two-dimensional mesh.
Jatin Upadhyay, Vara Varavithya, Prasant Mohapatra, "A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes", IEEE Transactions on Computers, vol. 46, no. , pp. 190-197, February 1997, doi:10.1109/12.565594