Embedding n-Dimensional Crossed Hypercube into Pancake Graphs

Abstract

Among Cayley graphs on the symmetric group, the pancake graph is one as a viable interconnection scheme for parallel computers, which has been examined by a number of researchers. The pancake was proposed as alternatives to the hypercube for interconnecting processors in parallel computers. Some good and attractive properties of this interconnection network include: vertex symmetry, small degree, a sub-logarithmic diameter, extendability, and high connectivity (robustness), easy routing, and regularity of topology, fault tolerance, extensibility and embeddability of other topologies. In this paper, we present the many-to-one dilation 5 embedding of n-dimensional crossed hypercube into n-dimensional pancake patients. These predictors, however, need further work to validate reliability.