DIMENSION-ORDER ROUTING
Dimension-order routing on the hypercube is essentially a
generalized version of the
greedy row-first routing on the 2D mesh. In row-first
routing, we adjust the column number
MODIFIED AND GENERALIZED
HYPERCUBES
The versatility and rich algorithmic and theoretical
properties of the hypercube have led
researchers define modified, augmented, generalized, or
hierarchical versi
ADAPTIVE AND FAULTTOLERANT ROUTING
Because there are up to q node-disjoint and edge-disjoint
shortest paths between any
node pairs in a q-cube, it is possible to route messages
around congested nodes/
BROADCASTING ON A
HYPERCUBE
A simple flooding scheme can be used for broadcasting a
message from one node to
all nodes in a q-cube in q steps, provided that each node
can send a message simultaneously
BUTTERFLY AND PERMUTATION
NETWORKS
In Section 14.4, we defined the butterfly network with 2q
nodes and q + 1 columns as
an unfolded q-cube in order to facilitate the discussion,
visualization, and ana
PLUS-OR-MINUS-2i NETWORK
a plus-or-minus-2i (PM2I) network with eight nodes (p = 2q
nodes
in general) in which each Node x is connected to every node
whose label is x 2i mod p for
some i. It is easy t
STAR AND PANCAKE NETWORKS
A possible compromise is to construct a network with
sublogarithmic, but nonconstant, node
degree. Such constructions may lead to a network whose
node degree does not grow as
PERFORMANCE PARAMETERS
FOR NETWORKS
In our discussions of various architectures thus far, we
have taken the network diameter
as an indicator of its communication latency. However,
network diameter, th
SHUFFLE AND SHUFFLE
EXCHANGE NETWORKS
A perfect shuffle, or simply shuffle, connectivity is one that
interlaces the nodes in a way
that is similar to a perfect shuffle of a deck of cards. That
is, Nod
THE CUBE-CONNECTED CYCLES
NETWORK
The cube-connected cycles (CCC) network can be derived
from a wrapped butterfly as
follows. Remove the pair of cross links that connect a pair
of nodes in Column i 1