This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Valved Routing: Efficient Flow Control for Adaptive Nonminimal Routing in Interconnection Networks
October 1995 (vol. 44 no. 10)
pp. 1181-1193

Abstract—Adaptive nonminimal routing (or misrouting) may move messages away from their destinations to temporarily cope with the dynamic load in an interconnection network. In most cases, misrouting is more powerful and flexible than minimal routing, especially under nonuniform load distribution. However, to take advantage of its misrouting, we have to avoid deadlock, livelock, and starvation in the network and to maintain the network performance across all levels of loading. In this paper, we propose a new flow control scheme for misrouting, called valved routing. Valved routing controls message injection and transmission through logical valves associated with the router ports. Designing routers using valved routing requires a proper choice of design parameters. We will discuss how to find the range of feasible design parameters. Issues in implementing routers using valved routing will also be addressed. We have conducted extensive simulations to compare the performance of routers with and without valved routing. Our simulation results show that valved routing has promising performance advantages, at light as well as heavy network load. Compared with the voluntary misrouting [15], valved routing performs better in network throughput without sacrificing the latency.

[1] A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
[2] W.C. Athas and C.L. Seitz, “Multicomputers: Message-Passing Concurrent Computers,” Computer, vol. 21, pp. 9-24, Aug. 1988.
[3] A. Borodin and J.E. Hopcroft,"Routing, merging and sorting on parallel models of comparison," J. Computer and System Science, vol. 30, pp. 130-145, 1985.
[4] S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross, H.T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P.S. Tseng, J. Sutton, J. Urbanski, and J. Webb iWarp: An Integrated Solution to High-Speed Parallel Computing, Proc. 1988 Int'l Conf. Supercomputing, pp. 330-339., IEEE CS and ACM SIGARCH, Orlando, Fla., Nov. 1988.
[5] 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.
[6] W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
[7] E.J. Kormondy,Concepts of Ecology.New York: Prentice Hall, 1976.
[8] S. Felperin, L. Gravano, G. Pifarre, and J. Sanz, "Fully-adaptive routing: Packet switching performance and wormhole algorithms," Proc. Supercomputing '91, pp. 654-663, 1991.
[9] P.T. Gaughan and S. Yalamanchili, “Adaptive Routing Protocols for Hypercube Interconnection Networks,” Computer, vol. 26, no. 5, pp. 12–23, May 1993.
[10] C.J. Glass and L.M. Ni, "The Turn Model for Adaptive Routing," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 278-287, May 1992.
[11] C.J. Glass and L.M. Ni,“Maximally fully adaptive routing in 2D meshes,” Technical Report MSU-CPS-ACS-51, 1992.
[12] P. Kermani and L. Kleinrock,“Virtual cut-through: A new computer communication switching technique,” Computer Networks, vol. 3, pp. 267-268, 1979.
[13] S. Konstantinidou and L. Snyder,“Choas router: A practical application of randomization in network routing,” ACM Computer Architecture News, pp. 79-88, Mar. 1991.
[14] 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.
[15] J.Y. Ngai and C.L. Seitz,“A framework for adaptive routing in multicomputer networks,” ACM Computer Architecture News, pp. 6-14, Mar. 1991.
[16] 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.
[17] D.A. Reed and R.M. Fujimoto,Multicomputer Networks: Message-Based Parallel Processing.Cambridge, Mass.: MIT Press, 1987.
[18] P.Y. Song,“Design of a network for concurrent message passing systems,” Master’s thesis, Dept. of Computer Science, MIT, May 1988.

Index Terms:
Deadlock, flow control, interconnection network, routing algorithm, router design, starvation.
Citation:
Chung-Ta King, Wei-Kuo Liao, "Valved Routing: Efficient Flow Control for Adaptive Nonminimal Routing in Interconnection Networks," IEEE Transactions on Computers, vol. 44, no. 10, pp. 1181-1193, Oct. 1995, doi:10.1109/12.467693
Usage of this product signifies your acceptance of the Terms of Use.