The hypercube has been used in numerous problems related to interconnection networks due to its simple structure and communication properties. The locally twisted cube is an important class of hypercube variants with the same number of nodes and connections per node, but has only half the diameter and better graph embedding capability as compared to its counterpart. The embedding problem plays a significant role in parallel and distributed systems. In this paper we devise an optimal embedding of the n-dimensional locally twisted cube onto a grid network.
展开▼
