Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed Computing
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
What Designers of Bus and Network Architectures Should Know about Hypercubes
IEEE Transactions on Computers
Optimal broadcasting in injured hypercubes using directed safety levels
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Conditional fault diameter of crossed cubes
Journal of Parallel and Distributed Computing
The Journal of Supercomputing
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
Information Sciences: an International Journal
A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
Theoretical Computer Science
| Hi-index | 0.01 |
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.