Abstract: Möbius cubes are an important class of hypercube variants. This paper addresses how to embed a family of disjoint 2D meshes into a Möbius cube. Two major contributions of this paper are: (1) For n ≥ 1, there exists a 2 × 2n−1 mesh that can be embedded in the n-dimensional Möbius cube with dilation 1 and expansion 1. (2) For n ≥ 4, there are two disjoint 4 × 2n−3 meshes that can be embedded in the n-dimensional 0-type Möbius cube with dilation 1. The results are optimal in the sense that the dilations of the embeddings are 1. The result (2) mean that a family of two 2D-mesh-structured parallel algorithms can be operated on a same crossed cube efficiently and in parallel. Key–Words: Möbius cubes, mesh embedding, dilation, expan...
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its opt...
Abstract—The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube h...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
AbstractThe hypercube is one of the most popular interconnection networks since it has simple struct...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...
The twisted cube is an important variant of the most popular hypercube network for parallel processi...
In this paper we study the problem of how to efficiently embed r intercon-nection networks Go,...,Gr...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
AbstractThe hypercube is one of the most popular interconnection networks since it has a simple stru...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
This paper parallelizes the embedding strategy for mapping any two-dimensional grid into its optimal...
A mesh of buses (MOB), a versatile parallel architecture, is obtained from a 2-dimensional mesh by r...
The hypercube is a particularly versatile network for parallel computing. It is wellknown that 2-dim...
[[abstract]]With dilation 2, congestion 2, expansion 3/2, and load 1, this short paper first present...
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its opt...
Abstract—The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube h...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
AbstractThe hypercube is one of the most popular interconnection networks since it has simple struct...
Various researchers have shown that the binary n- cube (or hypercube) can embed any r-ary m-cubes, ...
The twisted cube is an important variant of the most popular hypercube network for parallel processi...
In this paper we study the problem of how to efficiently embed r intercon-nection networks Go,...,Gr...
AbstractWe consider efficient simulations of mesh connected networks (or good representations of arr...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...
AbstractThe hypercube is one of the most popular interconnection networks since it has a simple stru...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
This paper parallelizes the embedding strategy for mapping any two-dimensional grid into its optimal...
A mesh of buses (MOB), a versatile parallel architecture, is obtained from a 2-dimensional mesh by r...
The hypercube is a particularly versatile network for parallel computing. It is wellknown that 2-dim...
[[abstract]]With dilation 2, congestion 2, expansion 3/2, and load 1, this short paper first present...
[[abstract]]We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its opt...
Abstract—The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube h...
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smal...