Abstract
Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks. These algorithms, unlike deterministic routing, can utilize network state information to exploit the presence of multiple paths. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors which affect their performance potential. This paper proposes a new analytical model to obtain message latency in wormhole-switched 2-D torus interconnect networks. The analysis focuses on a fully adaptive routing which has been shown to be one of the most effective in torus networks. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
Chapter PDF
Similar content being viewed by others
References
Duato, J., Yalamanchili, S., Ni, L.M.: Interconnection networks: An engineering approach. Morgan Kaufmann Publishers, New York (2003)
Ni, L.M., McKinley, P.K.: A Survey Of Wormhole Routing Techniques in Direct Networks. Computer 26(2), 62–76 (1993)
Dally, W.J., Aoki, H.: Deadlock-free adaptive routing in multicomputer networks using virtual channels. IEEE TPDS 4(4), 66–74 (1993)
Boppana, R.V., Chalasani, S.: A Framework for Designing Deadlock-Free Wormhole Routing Algorithms. IEEE TPDS 7(2), 169–183 (1996)
Safaei, F., et al.: Performance Comparison Of Routing Algorithms In Wormhole-Switched Fault-Tolerant Interconnect Networks. In: International Conference on Network and Parallel Computing (NPC06), Japan (October 2006)
Duato, J.: A New Theory of Deadlock-Free Adaptive Routing in Wormhole Routing Networks. IEEE TPDS 4(12), 320–1331 (1993)
Dally, W.J.: Virtual Channel Flow Control. IEEE TPDS 3(2), 194–205 (1992)
Kleinrock, L.: Queuing Systems, vol. 1. John Wiley, New York (1975)
Ould-Khaoua, M.: A Performance Model of Duato’s Adaptive Routing Algorithm in k-ary n-cubes. IEEE TC 48(12), 1–8 (1999)
Agarwal, A.: Limits on Interconnection Network Performance. IEEE TPDS 2(4), 398–412 (1991)
Draper, J.T., Ghosh, J.: A Comprehensive Analytical Model for Wormhole Routing in Multicomputer Systems. JPDC 32(2), 202–214 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Safaei, F., Khonsari, A., Fathy, M., Ould-Khaoua, M. (2007). Performance Evaluation of Fully Adaptive Routing for the Torus Interconnect Networks. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72590-9_89
Download citation
DOI: https://doi.org/10.1007/978-3-540-72590-9_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72589-3
Online ISBN: 978-3-540-72590-9
eBook Packages: Computer ScienceComputer Science (R0)