Abstract
The WK-recursive mesh and WK-pyramid networks are recursively-defined hierarchical interconnection networks with excellent properties which well idealize them as alternatives for mesh and traditional pyramid interconnection topologies. They have received much attention due to their favorable attributes such as small diameter, large connectivity, and high degree of scalability and expandability. In this paper, we deal with packagibility and layout area of these networks. These properties are of great importance in the implementation of interconnection networks on chips. We show that WK-recursive, mesh-pyramid and WK-pyramid networks can be laid out in an area of O(N2) which is the optimal area for VLSI layout of networks. Also, we obtained the number of tracks for laying nodes in a collinear model, where the chips are multi-layered.
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)
Leighton, F.T.: Introduction to parallel algorithms and architectures: Arrays, Trees and Hypercubes. Morgan Kaufmann, San Mateo (1992)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, NY (1976)
Hoseiny Farahabady, M., Sarbazi-Azad, H.: The WK-Recursive Pyramid: An Efficient Network Topology. In: 8th International Symposium on Parallel Architectures, Algorithms and Networks ISPAN 2005, pp. 312–317 (2005)
Hoseiny Farahabady, M., Sarbazi-Azad, H.: The grid-pyramid: A generalized pyramid network. Journal of Supercomputing 37, 23–45 (2006)
Chen, G.H., Duh., D.R.: Topological Properties, Communication, and Computation on WK-Recursive Networks. Networks 24, 303–317 (1994)
Yeh, C.-H., Varvarigos, E.A., Parhami, B.: Multilayer VLSI layout for interconnection networks. In: Proc. Int’l Conf. Parallel Processing, pp. 33–40 (2000)
Yeh, C.-H., Parhami, B.: On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks. IEEE Trans. Computer (2001)
Yeh, C.-H., Parhami, B., Varvarigos, E.A.: The recursive grid layout scheme for VLSI layout of hierarchical networks. In: Proc. Merged Int’l Parallel Processing Symp. & Symp. Parallel and Distributed Processing, pp. 441–445 (1999)
Thompson, C.D.: A Complexity Theory for VLSI. PHD thesis, Carnegie-Mellon Univ. (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bakhshi, S., Sarbazi-Azad, H. (2008). Efficient VLSI Layout of WK-Recursive and WK-Pyramid Interconnection Networks. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-89985-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89984-6
Online ISBN: 978-3-540-89985-3
eBook Packages: Computer ScienceComputer Science (R0)