Abstract
Originated from gas diffusion phenomenon, a new load balanced routing algorithm named Gas Diffusion Based Load balanced Routing (GDLR) is proposed for torus networks. GDLR estimates global congestion in the network by the number of potential deadlocked packets. Based on this information, the probabilities of all possible ports a packet may use are accordingly determined. Subsequently, packets are sent out with the stochastic policy, which leads to data load spreading with consequent automatic load balancing. Finally, simulations have been carried out on 2D torus networks by using OPNET software. The results obtained show that GDLR achieves a better performance than other popular algorithms such as Dimension Order, Duato, and GAL.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Scott, S., Thorson, G.: The cray t3e network: adaptive routing in a high performance 3d torus. In: Proceedings of Hot Interconnects Symposium IV (August 1996)
Pfister, G.: An Introduction to the InfiniBand Architecture. IEEE Press, Los Alamitos (2001), http://www.infinibadta.org
Dally, W.J., Carvey, P., Dennison, L.: Architecture of the Avici terabit switch/router. In: Proceedings of Hot Interconnects Symposium VI, August 1998, pp. 41–50 (1998)
Sullivan, H., Bashkow, T.R.: A large scale, homogeneous, fully distributed parallel machine, I. In: Proc. of the International Symposium on Computer Architecture, pp. 105–117 (1977)
Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks, an Engineering Approach. Morgan-Kaufmann Press, San Francisco (2003)
Dally, W., Towles, B.: Principles and Practices of Interconnection Networks. Morgan-Kaufmann Press, San Francisco (2004)
Duato, J.: A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks. IEEE Trans. on Parallel and Distributed Systems 4, 1320–1331 (1993)
Valiant, L.G.: A scheme for fast parallel communication. SIAM Journal on Computing 11(2), 350–361 (1982)
Singh, A., Dally, W.J., Towles, B., Gupta, A.K.: Globally adaptive load-balanced routing on tori. Computer Architecture Letters 3 (2004)
Singh, A., Dally, W.J., Gupta, A.K., Towles, B.: Adaptive Channel Queue Routing on k-ary n-cubes. In: SPAA. ACM Symposium on Parallelism in Algorithms and Architectures, Barcelona, Spain (June 2004)
Anjan, K.V., Pinkston, T.M., Duato, J.: Generalized theory for deadlock-free adaptive routing and its application to Disha Concurrent. In: Rolim, J.D.P. (ed.) Parallel and Distributed Processing. LNCS, vol. 1586, Springer, Heidelberg (1999)
Kim, J., Liu, Z., Chien, A.: Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing. IEEE Trans. Parallel and Distributed Systems 8(3), 229–244 (1997)
OPNET Modeler documentation. OPNET Technologies, Inc. (2004), http://www.opnet.com/
Kermani, P., Kleinrock, L.: Virtual Cut through: A new computer communication switching technique. Computer Networks 3, 34 (1979)
Ni, L., M., P., McKinley, K.: A Survey of Wormhole Routing Techniques in Directed Networks. Computer 26, 62–76 (1993)
Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks, an Engineering Approach. Morgan-Kaufmann Press, San Francisco (2003)
Dally, W., Towles, B.: Principles and Practices of Interconnection Networks. Morgan-Kaufmann Press, San Francisco (2004)
Newman, Internet Core Router Test (March 6, 2001), on the Web at http://www.lightreading.com
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niu, J., Gu, H., Wang, C. (2007). A New Load Balanced Routing Algorithm for Torus Networks. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)