The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2011 vol.22)
pp: 817-832
Parya Moinzadeh , Institute for Research in Fundamental Sciences (IPM), Tehran
Hamid Sarbazi-Azad , Sharif University of Technology and Institute for Research in Fundamental Sciences (IPM), Tehran
Albert Y. Zomaya , The University of Sydney, Sydney, Australia
ABSTRACT
In this paper, a diverse range of routing algorithms is classified into a new family of routings called zone-ordered label-based routing algorithms. The proposed classification is based on three common steps (factors) for generating such routings, namely, graph labeling, deadlock-free zones, and zone ordering. The main goal of this classification is to define several new routing concepts and streamline the knowledge on routing algorithms. Following the classification, a novel methodology is proposed to generate routing algorithms for irregular networks. The methodology uses the three mentioned steps to generate deadlock-free routings. Consequently, the methodology-based routings fall into the category of zone-ordered label-based routings. However, the graph labeling method (first step) used in the methodology is based on multiple spanning tree construction on the network. The simulation results show that constructing further spanning trees may result in routing algorithm with better performance.
INDEX TERMS
Algorithms, graph theory, routing, irregular networks.
CITATION
Parya Moinzadeh, Hamid Sarbazi-Azad, Albert Y. Zomaya, "Multispanning Tree Zone-Ordered Label-Based Routing Algorithms for Irregular Networks", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 5, pp. 817-832, May 2011, doi:10.1109/TPDS.2010.137
REFERENCES
[1] R. Moraveji, H. Sarbazi-Azad, and A. Tavakkol, "The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms," Proc. Int'l Conf. Computational Science, pp. 529-538, 2008.
[2] H. Nguyen, V. Ngo, and H. Choi, "Assessing Routing Behavior on On-Chip-Network," Proc. Int'l Conf. Computer Eng. and Systems, pp. 62-65, 2006.
[3] J. Flich, S. Rodrigo, and J. Duato, "An Efficient Implementation of Distributed Routing Algorithms for NoCs," Proc. ACM/IEEE Int'l Symp. Networks-on-Chip, pp. 87-96, 2008.
[4] J.C. Sancho, A. Robles, and J. Duato, "An Effective Methodology to Improve the Performance of the Up∗/Down∗ Routing Algorithm," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 8, pp. 740-745, Aug. 2004.
[5] S.J. Duato and L.N. Yalamanchili, Interconnection Networks: An Engineering Approach. IEEE Computer Society Press, 2003.
[6] O. Lysne, T. Skeie, S. Reinemo, and I. Theiss, "Layered Routing in Irregular Networks," IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 1, pp. 51-65, Jan. 2006.
[7] V. Puente, J.A. Gregorio, F. Vallejo, R. Beivide, and C. Izu, "High-Performance Adaptive Routing for Networks with Arbitrary Topology," J. System Architecture, vol. 52, pp. 345-358, 2006.
[8] M.D. Schroeder et al., "Autonet: A High-Speed, Self Configuring Local Area Network Using Point-to-Point Links," J. Selected Areas in Comm., vol. 9, pp. 1318-1335, 1991.
[9] J. Wu and L. Sheng, "Deadlock-Free Routing in Irregular Networks Using Prefix Routing," DIMACS Technical Report 99-19, 1999.
[10] M. Koibuchi, A. Funahashi, A. Jouraku, and H. Amano, "L-Turn Routing: An Adaptive Routing in Irregular Networks," Proc. Int'l Parallel Processing Conf., pp. 383-392, 2001.
[11] C.J. Glass and L.M. Ni, "The Turn Model for Adaptive Routing," Proc. Int'l Conf. Computer Architecture, pp. 278-287, 1992.
[12] A.A. Chien and J.H. Kim, "Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors," Proc. Int'l Conf. Computer Architecture, pp. 268-277, 1992.
[13] A. Nayebi, S. Meraji, A. Shamaei, and H. Sarbazi-Azad, "Xmulator: A Listener-Based Integrated Simulation Platform for Interconnection Networks," Proc. First Asia Int'l Conf. Modeling and Simulation, pp. 128-132, 2007.
[14] R. Moraveji, H. Sarbazi-Azad, and A.Y. Zomaya, "A General Methodology for Routing in Irregular Networks," Proc. IEEE Euromicro Int'l Conf. Parallel, Distributed, and Network-Based Processing (PDP), pp. 155-160, 2009.
[15] N.J. Boden et al., "Myrinet—A Gigabit Per Second Local Area Network," IEEE Micro, vol. 15, no. 1, pp. 29-36, Feb. 1995.
[16] R. Horst, "TNet: A Reliable System Area Network," IEEE Micro, vol. 15, no. 1, pp. 36-44, Feb. 1995.
[17] L. Wang, H. Song, D. Wen, and Y. Jiang, "A Degree Priority Routing Algorithm for Irregular Mesh Topology NoCs," Proc. Int'l Conf. Embedded Software and Systems, pp. 293-297, 2008.
[18] V. Samadi, A. Shamaei, H. Sarbazi-Azad, and M. Abbaspour, "A New Routing Algorithm for Irregular Mesh NoCs," Proc. Int'l System on Chip Conf. (ISOCC '08), 2008.
[19] G. Chiu, "The Odd-Even Turn Model for Adaptive Routing," IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 7, pp. 729-738, July 2000.
[20] J. Wu, "A Deterministic Fault-Tolerant and Deadlock-Free Routing Protocol in 2D Meshes Based on Odd-Even Turn Model," Proc. Int'l Conf. Supercomputing, pp. 67-76, 2002.
51 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool