Embedding mesh of trees in the hypercube
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Embedding meshes of trees into deBruijn graphs
Information Processing Letters
On the generalized twisted cube
Information Processing Letters
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
Lossless Image Compression by Block Matching on a Mesh of Trees
DCC '06 Proceedings of the Data Compression Conference
Embedding meshes into crossed cubes
Information Sciences: an International Journal
On Embedding Hamiltonian Cycles in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Embedding fault-free cycles in crossed cubes with conditional link faults
The Journal of Supercomputing
| Hi-index | 0.89 |
Crossed cubes are an important class of variants of hypercubes as interconnection topologies in parallel computing. In this paper, we study the embedding of a mesh of trees in the crossed cube. Let n be a multiple of 4 and N=2^(^n^-^2^)^/^2. We prove that an NxN mesh of trees (containing 3N^2-2N nodes) can be embedded in an n-dimensional crossed cube (containing 4N^2 nodes) with dilation 1 and expansion about 4/3. This result shows that crossed cubes are promising interconnection networks since mesh of trees enables fast parallel computation.