Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
Topological properties of twisted cube
Information Sciences—Informatics and Computer Science: An International Journal
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
Information Sciences—Informatics and Computer Science: An International Journal
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Embedding meshes into locally twisted cubes
Information Sciences: an International Journal
Embedding of tori and grids into twisted cubes
Theoretical Computer Science
A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
Information Sciences: an International Journal
Embedding multi-dimensional meshes into twisted cubes
Computers and Electrical Engineering
A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
Theoretical Computer Science
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
Hi-index | 0.89 |
The hypercube is one of the most popular interconnection networks since it has simple structure and is easy to implement. The twisted cube is an important variation of the hypercube. Let TQ"n denote the n-dimensional twisted cube. In this paper, we consider embedding a family of 2-dimensional meshes into a twisted cube. The main results obtained in this paper are: (1) For any odd integer n=1, there exists a mesh of size 2x2^n^-^1 that can be embedded in the TQ"n with unit dilation and unit expansion. (2) For any odd integer n=5, there exists a mesh of size 4x2^n^-^2 that can be embedded in the TQ"n with dilation 2 and unit expansion. (3) For any odd integer n=5, a family of two disjoint meshes of size 4x2^n^-^3 can be embedded into the TQ"n with unit dilation and unit expansion. Results (1) and (3) are optimal in the sense that the dilations and expansions of the embeddings are unit values.