Optimal simulation of linear multiprocessor architectures on multiply-twisted cube using generalized Gray Codes
S. Q. Zheng, Seyed Milad Mir Latifi · IEEE Transactions on Parallel and Distributed Systems · 1996
We consider the problem of simulating linear arrays and rings on the multiply twisted cube. We introduce a new concept, the reflected link label sequence, and use it to define a generalized Gray Code (GGC). We show that GGCs can be easily used to identify Hamiltonian paths and cycles in the multiply twisted cube. We also give a method for embedding a ring of arbitrary number of nodes into the multiply twisted cube.