Static and Dynamic
Static and Dynamic
Complete binary tree networks: (a) a static tree network; and (b)
a dynamic tree network.
Network Topologies: Tree Properties
Completely-connected
Star
Linear array
Hypercube
Crossbar
Omega Network
Dynamic Tree
Routing Mechanisms
for Interconnection Networks
0
Embedding a Linear Array
into a Hypercube
The function G is called the binary reflected Gray
code (RGC).
(a) A three-bit reflected Gray code ring; and (b) its embedding into a
three-dimensional hypercube.
Embedding a Mesh
into a Hypercube
• A 2r × 2s wraparound mesh can be mapped to a 2r+s-
node hypercube by mapping node (i, j) of the mesh onto
node G(i, r− 1) || G(j, s − 1) of the hypercube (where ||
denotes concatenation of the two Gray codes).
Embedding a Mesh into a Hypercube
(a) Embedding a 16 node linear array into a 2-D mesh; and (b) the
inverse of the mapping. Solid lines correspond to links in the linear
array and normal lines to links in the mesh.
Embedding a Hypercube into a 2-D Mesh