Abstract
The twisted cube is an important variant of the most popular hypercube network for parallel processing. In this paper, we consider the problem of embedding multi-dimensional meshes into twisted cubes in a systematic way. We present a recursive method for embedding a family of disjoint multi-dimensional meshes into a twisted cube with dilation 1 and expansion 1. We also prove that a single multi-dimensional mesh can be embedded into a twisted cube with dilation 2 and expansion 1. Our work extends some previously known results.
Original language | English |
---|---|
Pages (from-to) | 1021-1026 |
Number of pages | 6 |
Journal | Computers and Electrical Engineering |
Volume | 36 |
Issue number | 6 |
DOIs | |
State | Published - Nov 2010 |
Keywords
- Graph embedding
- Interconnection networks
- Mesh
- Parallel processing
- Twisted cube