Optimal simulation of linear multiprocessor architectures on multiply-twisted cube using generalized Gray Codes

被引：23

作者：

Zheng, SQ ^{[1
]}

Latifi, S ^{[1
]}

机构：

[1] UNIV NEVADA,DEPT ELECT & COMP ENGN,LAS VEGAS,NV 89154

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1996年 / 7卷 / 06期

关键词：

Gray Code; interconnection network; hypercube; multiply-twisted cube; linear array; ring; parallel computing simulation;

D O I：

10.1109/71.506700

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 GGC'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.

引用

页码：612 / 619

页数：8

共 13 条

[1]

BHUYAN LN, 1984, IEEE T COMPUT, V33, P323, DOI 10.1109/TC.1984.1676437

[2] PROCESSOR ALLOCATION IN AN N-CUBE MULTIPROCESSOR USING GRAY CODES [J].