Optimal simulation of linear multiprocessor architectures on multiply-twisted cube using generalized gray codes
IEEE Transactions on Parallel and Distributed Systems
First page number:
Last page number:
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
Electrical and Computer Engineering | Engineering | Signal Processing | Systems and Communications
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
Zheng, S. Q.,
Optimal simulation of linear multiprocessor architectures on multiply-twisted cube using generalized gray codes.
IEEE Transactions on Parallel and Distributed Systems, 7(6),