This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Balancing Buffer Utilization in Meshes Using a 'Restricted Area' Concept
August 2002 (vol. 13 no. 8)
pp. 814-827

Abstract—Adaptive routing and virtual channels are used to increase routing adaptivity in wormhole-routed two-dimensional meshes. But increasing channel buffer utilization without considering even distribution of the traffic loads tends to cause congestion in the most adaptive routing area. To avoid such traffic congestion, a concept of the restricted area is proposed in this paper. The proposed restricted area, defined to be a part of the network where message transmission concentrates, can be located following the region of adaptivity. By properly guiding message routing inside and outside the area, we are able to achieve more balanced buffer utilization and to reduce traffic congestion accordingly. The performance of several routing algorithms with or without using the restricted area is simulated and evaluated under various traffic loads and distribution patterns. The results indicate that routing algorithms with the restricted areas yield constantly larger throughput and smaller latency than routing algorithms without using the concept.

[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] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[3] 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.
[4] J. Upadhyay, V. Varavithya, and P. Mohapatra, “A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes,” IEEE Trans. Computers, vol. 46, no. 2, pp. 190-197, Feb. 1997.
[5] C.-C. Su and K.G. Shin, “Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel,” Proc. 22nd Int'l Conf. Parallel Processing, vol. I, pp. 227-231, Aug. 1993.
[6] 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.
[7] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J. ACM, vol. 41, no. 5, pp. 874-902, Sept. 1994.
[8] 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.
[9] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[10] V.S. Adve and M.K. Vernon, “Performance Analysis of Mesh Interconnection Networks with Deterministic Routing,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 3, pp. 225-246, Mar. 1994.
[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] F. Petrini and M. Vanneschi, “Performance Analysis of Minimal Adaptive Wormhole Routing with Time-Dependent Deadlock Recovery,” Proc. 11th Int'l Parallel Processing Symp., pp. 589-595, Apr. 1997.
[13] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[14] 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.

Index Terms:
Adaptive routing algorithms, balanced buffer utilization, meshes, performance evaluation, turn model, virtual channels, wormhole routing.
Citation:
Po-Jen Chuang, Juei-Tang Chen, Yue-Tsuen Jiang, "Balancing Buffer Utilization in Meshes Using a 'Restricted Area' Concept," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 8, pp. 814-827, Aug. 2002, doi:10.1109/TPDS.2002.1028438
Usage of this product signifies your acceptance of the Terms of Use.