Research on petersen graphs and hyper-cubes connected interconnection networks

Authors:
Wang Lei;Chen Zhiping
Affiliations:
Department of Computer and Information Science, Fujian University of Technology, Fuzhou, Fujian, RP China;Department of Computer and Information Science, Fujian University of Technology, Fuzhou, Fujian, RP China
Venue:
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Year:
2006

Citing 8
Cited 0

The twisted cube

Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
Edge Congestion and Topological Properties of Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant Hamiltonicity of twisted cubes

Journal of Parallel and Distributed Computing
What Designers of Bus and Network Architectures Should Know about Hypercubes

IEEE Transactions on Computers
The Petersen graph is not 3-edge-colorable: a new proof

Discrete Mathematics
Fault-tolerant cycle-emebedding of crossed cubes

Information Processing Letters
A delay optimal coterie on the k-dimensional folded Petersen graph

Journal of Parallel and Distributed Computing
Topological properties of twisted cube

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.