Research Of The Embedding Of The Exchanged Hypercube Networks

High performance computing of parallel computing system depends on a interconnection network with good performance. This paper firstly analyzes the crossed cube network (CQn), the twisted cube network (TQn), exchanged hypercube network (EHu+v+1) structure and its important properties: isomorphism, recursion, progeny adjacency, Hamilton, embedding sex. Secondly, the embedding problems on these networks are studied.The exchanged hypercube network and its embeddedness is the main subject of this paper, in view of other network embedded mapping parameter exchange hypercube networks:expansion(ep), load(ld), dilation(dla), congestion(cong), gives a variety of specific embedding, prove that the exchanged hypercube networks is universal better, and reflect its ability to simulate other networks.In this paper, using the method of graph theory, firstly the geometric network graph into a labeled graph and graph, then the labeled graphs and plots were constructed on labeled graph adjacency list, and the vertices of a graph according to the adjacency list order embedding mapping definition, produces a mapping table adjacent to the embedded, given the crossed cube, twisted cube network to embedding mapping exchanged hypercube networks. Finally, analysis of the four embedded parameter expansion(ep), load(ld), dilation(dla), congestion(cong),whether can achieve the best embedding or isomorphic embedding, prove the evaluation performance of the embedded mapping.