This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes
February 1997 (vol. 46 no. 2)
pp. 190-197

Abstract—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 positive-first-negative-first 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.

[1] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[2] C.J. Glass and L.M. Ni, “Adaptive Routing in Mesh-Connected Networks,” Proc. 1992 Int'l Conf. on Distributed Computing Systems, pp. 12-19, May 1992.
[3] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J. ACM, vol. 41, no. 5, pp. 874-902, Sept. 1994.
[4] Y.M. Boura and C.R. Das, "A Class of Partially Adaptive Routing Algorithms for n-Dimensional Meshes," Proc. Int'l. Conf. Parallel Processing, vol. 3, pp. 175-182, Aug. 1993.
[5] A.A. Chien and J.H. Kim, "Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors," J. ACM, vol. 42, no. 1, pp. 91-123, 1995.
[6] D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[7] J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
[8] C. Su and K.G. Shin, "Adaptive Deadlock-Free Routing in MultiComputers Using Only One Extra Channel," Proc. 22nd Int'l Conf. Parallel Processing, vol. 3, pp. 175-182, Aug. 1993.
[9] Y.M. Boura and C.R. Das, “Efficient Fully Adaptive Wormhole Routing inn-Dimensional Meshes,” Proc. 14th Int'l Conf. Distributed Computing Systems, pp. 589-596, May 1994.
[10] L. Schwiebert and D.N. Jayasimha, “Optimally Fully Adaptive Minimal Wormhole Routing for Meshes,” J. Parallel and Distributed Computing, vol. 27, pp. 56-70, 1995.
[11] R. Boppana and S. Chalasani, "A Comparison of Adaptive Wormhole Routing Algorithms," Proc. 20th Ann. Int'l Symp. Computer Architecture," pp. 351-360, 1993.
[12] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[13] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[14] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[15] W.J. Dally and H. Aoki, "Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
[16] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1,055–1,067, Oct. 1995.
[17] V. Varavithya, "Wormhole Routing Algorithms for Mesh InterConnection Networks," masters thesis, Dept. of Electrical and Computer Eng., Iowa State Univ., 1994.

Index Terms:
Adaptive wormhole routing, positive-first-negative-first algorithm, region of adaptivity, traffic distribution, two-dimensional mesh.
Citation:
Jatin Upadhyay, Vara Varavithya, Prasant Mohapatra, "A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes," IEEE Transactions on Computers, vol. 46, no. 2, pp. 190-197, Feb. 1997, doi:10.1109/12.565594
Usage of this product signifies your acceptance of the Terms of Use.