Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes
Issue No. 06 - June (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.506700
<p><b>Abstract</b>—In this article, 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 (<it>GGC</it>). We show that <it>GGC</it>s 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.</p>
Gray code, interconnection network, hypercube, multiply-twisted cube, linear array, ring, parallel computing, simulation.
S. Zheng and S. Latifi, "Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 612-619, 1996.