Abstract
On the basis of the short diameter of Petersen graph, and high connectivity of Hypercube, an innovative interconnection network named HRP(n) (Hyper-cubes and Rings connected Petersen Graph), is proposed, and whose characteristics are studied simultaneously. It is proved that HRP(n) has not only regularity and good extensibility, but also has shorter diameter and better connectivity than those interconnection networks such as Qn, TQn, CQn, and HP(n). In addition, the unicasting, broadcasting, and fault-tolerant routing algorithms are designed for HRP(n), analyses show that those routing algorithms have good communication efficiency.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
LaForge, L.E., Korver, K.F., Fadali, M.S.: What Designers of Bus and Network Architectures Should Know about Hypercubes. IEEE Transactions on Computers 4, 525–544 (2003)
Saxena, P.C., Gupta, S., han Rai, J.: A delay optimal coterie on the k dimensional folded Petersen graph. Journal of Parallel Distributed Computing 63, 1026–1035 (2003)
Naserasr, Skrekovski, R., Riste: The Petersen Grapg is not 3-Edge-Colorable: A New Proof. Discrete Mathmatics 1, 325–326 (2003)
Hibers, P.A.J., Koopman, M.R.J., van de Snepscheut, J.L.A.: The twisted cube. LNCS, vol. 2809, pp. 152–159. Springer, Heidelberg (1987)
Chang, C.-P., Wang, J.-N., Hsu, L.-H.: Topological Properties of Twisted Cube. Information Science 1, 147–167 (1999)
Huang, W.-T., Tan, J.J.M., Hung, C.-N., Hsu, L.-H.: Fault Tolerant Hamiltonicity of Twisted Cubes. Journal of Parallel and Distributed Computing 4, 591–604 (2002)
Chang, C.-P., Sung, T.-Y., Hsu, L.H.: Edge congestion and topological properties of crossed cubes. IEEE Transactions on Parallel and Distributed Systems 1, 64–80 (2000)
Yang, M.-C., Li, T.-K., Tan, J.J.M., Hsu, L.-H.: Fault-tolerant cycle embedding of crossed cubes. Information Processing Letters 4, 149–154 (2003)
Lei, W., Yaping, L.: A Fault-tolerant Routing Strategy Based on Maximum Safety-Path Vectors for Hypercube Multicomputers. Journal of China Institute of Communications 4, 130–137 (2004)
Lei, W., Yaping, L.: Fault-tolerant Routing for Hypercube Multicomputers Based on Maximum Safety-Path Matrix. Journal of Software 7, 994–1004 (2004)
Das, S.K., Banerjee, A.K.: Hyper Petersen network: yet another hypercube-like topology. In: Proceedings of Fourth Symposium on the Frontiers of Massively Parallel Computation, San Francisco, USA, pp. 270–278. IEEE Computer Society, Los Alamitos (1992)
Fang-Ai, L., Zhi-Yong, L., Zhen, Q.X.: A practical interconnection network RP(k) and its routing algorithms. Science in China (Serial F) 6, 461–473 (2001)
Lei, W., Yaping, L.: Topology and Routing Algorithms of 2-D Torus/Double-Loops connected Petersen Graph Networks. Chinese Journal of Computers 9, 1290–1296 (2004)
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
Lei, W., Zhiping, C. (2006). Research on Petersen Graphs and Hyper-cubes Connected Interconnection 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_49
Download citation
DOI: https://doi.org/10.1007/11859802_49
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)