This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes
June 1996 (vol. 7 no. 6)
pp. 612-619

Abstract—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 (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.

[1] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 33, no. 4, pp. 323-333, Apr. 1984.
[2] M. S. Chen and K. G. Shin,“Processor allocation in an$N$-cube multiprocessor using gray codes,”IEEE Trans. Comput., vol. C-37, pp. 1396–1407, Dec. 1987.
[3] E. Dixon and S. Goodman, "On the Number of Hamiltonian Circuits in the n-Cube," Proc. Am. Math. Soc., vol. 50, pp. 500-504, 1975.
[4] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 1312-1316, Nov. 1991.
[5] K. Efe, “The Crossed Cube Architecture for Parallel Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513-524, Sept.-Oct. 1992.
[6] K. Efe and W. Slough, "Topological Properties of Mutiply-Twisted Cube," Technical Report, 90-8-2, Center for Advanced Computer Studies, Univ. of Southwestern Louisiana, 1990.
[7] A. El-Amawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 31-42, 1991.
[8] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, "The Twisted n-Cube with Application to Multiprocessing," IEEE Trans. Computers, vol. 40, no. 1, pp. 88-93, Jan. 1991.
[9] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
[10] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133-172, 1987.
[11] P. Kulasinghe and S. Bettayeb, “Embedding Binary Trees into Crossed Cubes,” IEEE Trans. Computers, vol. 44, no. 7, pp. 923-929, July 1995.
[12] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[13] S. Latifi and S.Q. Zheng, "On Hamiltonian Cycles of Cube-based Interconnection Networks," J. Computers and Electrical Eng., vol. 21, no. 3, pp. 189-199, 1995.

Index Terms:
Gray code, interconnection network, hypercube, multiply-twisted cube, linear array, ring, parallel computing, simulation.
Citation:
S.q. Zheng, Shahram Latifi, "Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 6, pp. 612-619, June 1996, doi:10.1109/71.506700
Usage of this product signifies your acceptance of the Terms of Use.