Abstract
The surface area which is defined as the number of vertices at a given distance from a base vertex of a graph is considered to be as one of the most useful yet abstract combinatorial properties of a graph. The applicability of surface area spans many problem spaces such as those in parallel and distributed computing. These problems normally involve combinatorial analysis of underlying graph structures (e.g., spanning tree construction, minimum broadcast algorithms, efficient VLSI layout, performance modeling). In this paper, we focus on the problem of finding the surface area of a class of popular graphs, namely the family of WK-recursive and swapped networks. These are attractive networks due to their useful recursive structures.
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
Abraham, S.: Issue in the design of direct interconnection networks schemes for the multiprocessors. PhD Thesis, University of Illinois at Urbana-Champaign (1992)
Sarbazi-Azad, H.: On Some Combinatorial Properties of Meshes. In: Proceedings of IEEE International Symposium on Parallel Architectures and Networks, pp. 117–122. IEEE Computer Society Press, Los Alamitos (2004)
Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L., Akl, S.G.: On the Combinatorial Properties of k-ary n-Cubes. Journal of Interconnection Networks 5, 79–91 (2004)
Broeg, B.: Topological properties of of k-ary n-cubes. PhD Thesis, Department of Computer Science, Oregon State Univ. (1995)
Cobett, P.F.: Rotator Graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Transaction on Parallel and Distributed Systems 3, 622–626 (1992)
Duh, D.R., Chen, G.H.: Topological properties of WK-recursive networks. Journal of Parallel and Distributed Computing 23, 468–474 (1994)
Hoseiny Farahabady, M., Sarbazi-Azad, H.: The WK-Recursive Pyramid: An Efficient Network Topology. In: International Symposium on Parallel Architectures, Algorithms and Networks, pp. 312–317 (2005)
Fang, J.F., Lai, G.J., Liu, Y.C., Fang, S.T.: A novel broadcasting scheme for WK-recursive networks. Communications, Computers and Signal Processing, pp.1028–1031(2003)
Farahabady, M.H., Sarbazi-Azad, H.: The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors. In: Proceedings of the 2005 ACM symposium on Applied computing, pp. 734–738 (2005)
Fu, J.S.: Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes. IEEE Transactions on Parallel and Distributed Systems 16, 853–865 (2005)
Imani, N., Sarbazi-Azad, H., Akl, S.G.: On Some of the Combinatorial Properties of the Star Graph. In: Proceedings of international symposium on Parallel Architectures, Algorithms and Networks, pp. 58–65 (2005)
Parhami, B.: Swapped interconnection networks: Topological, Performance, and robustness attributes. J. Parallel Distrib. Comput. 65, 1443–1452 (2005)
Rahmati, D., Kiasari, A.E., Hessabi, S., Sarbazi-Azad, H.: Performance comparison of WK-recursive and mesh networks for Networks-on-chip. In: IEEE International Conference on Computer Design, pp. 142–147. IEEE Computer Society Press, Los Alamitos (2006)
Vecchia, D., Sanges, C.: Recursively Scalable Networks for Message Passing Architectures. In: Proc. Conf. Parallel Processing and Applications, pp. 33–40 (1987)
Yeh, C.-H., Parhami, B.: Swapped networks: unifying the architectures and algorithms of a wide class of hierarchical parallel Processors. In: Proceedings of the International Conference on Parallel and Distributed Systems, pp. 230–237 (1996)
Imani, N., Sarbazi-Azad, H., Zomaya, A.: Some combinatorial properties of recursive networks. Technical reports, School of Computer Science, IPM, Iran (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Imani, N., Sarbazi-Azad, H., Zomaya, A.Y. (2007). Some Properties of WK-Recursive and Swapped Networks. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_76
Download citation
DOI: https://doi.org/10.1007/978-3-540-74742-0_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74741-3
Online ISBN: 978-3-540-74742-0
eBook Packages: Computer ScienceComputer Science (R0)