Beruflich Dokumente
Kultur Dokumente
Terminology - 2
Terminology - 1 Channel bisection width b = minimum number of edges cut
to split a network into two parts each having the same
Network usually represented by a graph with a finite number of nodes. Since each channel has w bit wires, the
number of nodes linked by directed or undirected edges. wire bisection width B = bw. Bisection width provides good
Number of nodes in graph = network size . indication of maximum communication bandwidth along the
Number of edges (links or channels) incident on a node = bisection of a network, and all other cross sections should
node degree d (also note in and out degrees when edges be bounded by the bisection width.
are directed). Node degree reflects number of I/O ports Wire (or channel) length = length (e.g. weight) of edges
associated with a node, and should ideally be small and between nodes.
constant. Network is symmetric if the topology is the same looking
Diameter D of a network is the maximum shortest path from any node; these are easier to implement or to
between any two nodes, measured by the number of links program.
traversed; this should be as small as possible (from a Other useful characterizing properties: homogeneous
communication point of view). nodes? buffered channels? nodes are switches?
1
Data Routing Functions Permutations
Shifting Given n objects, there are n ! ways in which they
Rotating can be reordered (one of which is no reordering).
Permutation (one to one) A permutation can be specified by giving the rule
Broadcast (one to all) fo reordering a group of objects.
Multicast (many to many) Permutations can be implemented using crossbar
switches, multistage networks, shifting, and
Personalized broadcast (one to many) broadcast operations. The time required to
Shuffle perform permutations of the connections between
Exchange nodes often dominates the network performance
Etc. when n is large.
2
Static Networks – Linear Array Static Networks – Ring, Chordal Ring
N nodes connected by n-1 links (not a bus); Like a linear array, but the two end nodes are
segments between different pairs of nodes can be connected by an n th link; the ring can be uni- or
used in parallel. bi-directional. Diameter is n/2 for a bidirectional
ring, or n for a unidirectional ring.
Internal nodes have degree 2; end nodes have
By adding additional links (e.g. “chords” in a
degree 1. circle), the node degree is increased, and we
Diameter = n-1 obtain a chordal ring. This reduces the network
Bisection = 1 diameter.
For small n, this is economical, but for large n, it is In the limit, we obtain a fully-connected network,
with a node degree of n -1 and a diameter of 1.
obviously inappropriate.
3
Static Networks – Systolic Array Static Networks – Hypercubes
A systolic array is an arrangement of processing A binary n-cube architecture with N = 2n nodes
elements and communication links designed spanning along n dimensions, with two nodes per
specifically to match the computation and dimension.
communication requirements of a specific The hypercube scalability is poor, and packaging is
algorithm (or class of algorithms). difficult for higher-dimensional hypercubes.
This specialized character may yield better
performance than more generalized structures, but
also makes them more expensive, and more
difficult to program.
4
Minimizing Latency Dynamic Connection Networks
Latency is minimized when the network radix k and Dynamic connection networks can implement all
dimension n are chose so as to make the communication patterns based on program demands.
components of latency due to distance (# of hops) In increasing order of cost and performance, these include
bus systems
and the message aspect ratio L / W (message
multistage interconnection networks
length L divided by the channel width W ) crossbar switch networks
approximately equal. Price can be attributed to the cost of wires, switches,
This occurs at a very low dimension. For up to arbiters, and connectors.
1024 nodes, the best dimension (in this respect) is Performance is indicated by network bandwidth, data
2. transfer rate, network latency, and communication patterns
supported.
5
Baseline Network 4 × 4 Baseline Network
A baseline network can be shown to be
topologically equivalent to other networks
(including Omega), and has a simple recursive
generation procedure.
Stage k (k = 0, 1, …) is an m × m switch block
(where m = N / 2 k ) composed entirely of 2 × 2
switch blocks, each having two configurations:
straight through and crossover.
6
Summary: Wiring Complexity Summary: Switching Complexity