Title

Optimal Simulation of Linear Multiprocessor Architectures on Multiply-twisted Cube Using Generalized Gray Codes

Document Type

Article

Publication Date

6-1996

Publication Title

IEEE Transactions on Parallel and Distributed Systems

Volume

7

Issue

6

First page number:

612

Last page number:

619

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

Disciplines

Electrical and Computer Engineering | Engineering | Signal Processing | Systems and Communications

Language

English

Permissions

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.

Identifier

DOI: http://dx.doi.org/10.1109/71.506700

UNLV article access

Search your library

Share

COinS