Abstract
In this paper, we investigate an efficient deadlock-free shortest path routing algorithm for WK-recursive mesh networks which has been shown that possess several advantages like suitable to be manufactured by VLSI technology and easy to be expanded. It will be shown that the proposed algorithm requires O(\(\sqrt{n}\)) routing steps (where N is the network size) to route the entire network by exploiting either the self-routing or second order routing scheme.
This is a preview of subscription content, log in via an institution to check access.
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
Della Vecchia, G., Sanges, C.: A Recursively Scalable Network VLSI Implementation. Future Generation Computer Systems 4(3), 235–243 (1988)
Fu, J.-S.: Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes. IEEE TPDSÂ 16(9) (2005)
Hoseiny Farahabady, M., Sarbazi-Azad, H.: The WK-Recursive Pyramid: An Efficient Network Topology. In: ISPAN 2005. 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 312–317 (2005)
Chen, G.H., Duh, D.R.: Topological Properties, Communication, and Computation on WK-Recursive Networks. Networks 24, 303–317 (1994)
Verdoscia, L., Vaccaro, R.: An Adaptive Routing Algorithm for WK-Recursive Topologies. Computing 63(2), 171–184 (1999)
Dally, W., Seitz, C.: Deadlock free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, 547–553 (1987)
Hoseiny Farahabady, M., Sarbazi-Azad, H.: The RTCC-pyramid: a versatile hierarchical network for parallel computing. In: Proc. 8th International Conference on High Performance Computing in Asia Pacific Region (HPC Asia), China, pp. 493–498 (2005)
Rezazad, M., Hoseiny Farahabady, M., Sarbazi-Azad, H.: Shortest Path Routing Algorithm and performance evaluation for WK-Recursive Meshes, Technical Report, IPM school of computer science (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rezazad, M., Farahabady, M.H., Sarbazi-Azad, H. (2007). A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds) Distributed Computing and Networking. ICDCN 2008. Lecture Notes in Computer Science, vol 4904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77444-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-77444-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77443-3
Online ISBN: 978-3-540-77444-0
eBook Packages: Computer ScienceComputer Science (R0)