Title :
Optimal simulation of linear multiprocessor architectures on multiply-twisted cube using generalized Gray Codes
Author :
Zheng, S.Q. ; Latifi, Shahram
Author_Institution :
Dept. of Comput. Sci., Louisiana State Univ. Baton Rouge, LA, USA
fDate :
6/1/1996 12:00:00 AM
Abstract :
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
Keywords :
Gray codes; multiprocessor interconnection networks; virtual machines; GGCs; Hamiltonian paths; generalized Gray Codes; hypercube; interconnection network; linear array simulation; linear multiprocessor architectures; multiply twisted cube; optimal simulation; parallel computing; reflected link label sequence; Computational modeling; Computer architecture; Computer science; Data communication; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Sorting; Switches; Tree graphs;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
