Abstract
Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network (EPM, for short), by replacing each mesh in a pyramid network (PM, for short) with a torus. Recently, some topological properties and communication on the EPMs have been investigated or derived. Their results have revealed that an EPM is an attractive alternative to a PM. This study investigates the node-disjoint paths between any two distinct nodes and the upper bound of the ω-wide-diameter of an EPM. This result shows that the EPMs have smaller ω-wide-diameters than the PMs.
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
Cao, F., Du, D.-Z., Hsu, D.F., Teng, S.-H.: Fault tolerance properties of pyramid networks. IEEE Transactions on Computers 48, 88–93 (1999)
Chen, Y.-C.: Pancycles and Hamiltonian connectedness of the pyramid network with one node or one edge fault. Master Report, Department of Computer Science and Information Engineering, National Chi Nan University (2003)
Chen, W.-M., Chen, G.-H., Hsu, D.-F.: Generalized diameters of the mesh of trees. Theory of Computing Systems 37, 547–556 (2004)
Chen, Y.-C., Duh, D.-R., Hsieh, H.-J.: On the enhanced pyramid network. In: Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications, Monte Carlo Resort, Las Vegas, Nevada, USA, pp. 1483–1489 (2004)
Cinque, L., Bongiovanni, G.: Parallel prefix computation on a pyramid computer. Pattern Recognition Letter 16, 19–22 (1995)
Cipher, R., Sanz, J.L.C.: SIMD architectures and algorithms for image processing and computer vision. IEEE Transactions on Acoustic, Speech, and Signal Processing 37, 2158–2174 (1989)
Hsieh, H.-J., Duh, D.-R., Shiau, J.-S.: A constant time shortest-path routing algorithm for pyramid networks. In: Proc. Int. Conf. on Parallel and Distributed Computing and Systems, pp. 71–75. MIT, Cambridge (2004)
Hsieh, H.-J., Duh, D.-R.: An Optimal Broadcasting Algorithm for Pyramid Networks. In: Proc. the 9th World Multiconference on Systemics, Cybernetics and Informatics, Orlando, Florida, USA, pp. 266–270 (2005)
Hsieh, H.-J., Duh, D.-R.: Containers in Enhanced Pyramid Networks. Technical Report (2006), http://tr.csie.ncnu.edu.tw/scripts/TR.asp?TRNo=NCNUCSIE-TR20060004
Hsu, D.F.: Graph containers, information delay, and network vulnerability. In: Proc. Int. Conf. on Advanced Information Networking and Applications, vol. 1, pp. 16–21 (2004)
Jenq, J.F., Sahni, S.: Image shrinking and expanding on a pyramid. IEEE Transactions on Parallel and Distributed Systems 4, 1291–1296 (1993)
Omura, S., Zheng, H., Wada, K.: Neighborhood broadcasting in undirected de Bruijn and Kautz networks. IEICE Transactions on Information and Systems E-88-D, 89–95 (2005)
Park, J.-H.: Two-dimensional ring-banyan network: a high-performance fault-tolerant switching network. Electronics Letters 42, 249–251 (2006)
Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M.: Algorithmic construction of Ham-iltonians in pyramids. Information Processing Letters 80, 75–79 (2001)
Shen, Z.: A routing algorithm for pyramid structures. In: Proc. ACM Symposium on Applied Computing, Las Vegas, Nevada, USA, pp. 484–488 (2001)
Wu, R.-Y.: Hamiltonicity of pyramid networks. Master Report, Department of Computer Science and Information Engineering, National Chi Nan University (2001)
Xu, J.: Topological structure and analysis of interconnection networks. Kluwer, Netherlands (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsieh, HJ., Duh, DR. (2006). Constructing Node-Disjoint Paths in Enhanced Pyramid Networks. In: Jesshope, C., Egan, C. (eds) Advances in Computer Systems Architecture. ACSAC 2006. Lecture Notes in Computer Science, vol 4186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11859802_33
Download citation
DOI: https://doi.org/10.1007/11859802_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40056-1
Online ISBN: 978-3-540-40058-5
eBook Packages: Computer ScienceComputer Science (R0)