birds eye view of interconnection networks
DESCRIPTION
Birds Eye View of Interconnection Networks. The P ower of Topology The E ffect of Network The G race of Solution. Study of Interconnection Networks. Classification: Static vs. Dynamic. P1. P2. P3. M1. M2. M3. 110. 111. 100. 101. 010. 011. 000. 001. - PowerPoint PPT PresentationTRANSCRIPT
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
1
Birds Eye View of Interconnection Networks
The Power of Topology
The Effect of Network
The Grace of Solution
2
Glimpse at Interconnection Networks
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
Seas for Networks
A wide variety of direct interconnection networks have been proposed for, or used in, parallel computers
They differ in topological, performance, robustness, and reliability attributes.
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
4
Classification: Static vs. Dynamic
Static or Direct Ring Mesh Hypercube ………
Dynamic or Indirect: Bus, Crossbar, MIN
000 001
100
110 111
011010
101
P1
P2
P3
M1 M2 M3
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
5
Line, Ring and Fully Connected
Linear Array: the simplest topology. Fully Connected: Direct connection between every pair of processors, Highest cost, Similar to crossbar in some properties. Ring: Each node in the ring is connected to only two other nodes.Chordal Ring: A compromise between Ring and Fully Connected Network.
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
6
Mesh and Torus
Mesh Topology 3D Torus2D Torus
2D torus: Meshes with ``wraparound'' connections, e.g. the node at the top of the grid has an ``up'' link that connects to the node at the bottom of the grid (also left to right).
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
7
Hypercube
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
8
Tree and Star
Tree and Star
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
9
Fat Tree
Note that a message going from PE2 to PE5 may choose any one of four paths from the lower left router to the one at the root. This means that all four PE's attached to the lower left router have a path available to them to reach another node.
4 port
8 port
PE2 PE5
four paths
PE1 PE3 PE10PE9PE8PE7PE6 PE16PE14PE13PE12PE11PE4 PE15
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
10
Crossbar switch
P0 –> M1P1 –> M3P2 –> M2P3 –> M0
Crossbar switch
N*N switches (N processors N memory modules). The switch configures itself dynamically to connect a processor to a memory
module. No contention -- Supports N! permutations. Costly, hard to scale, wastes switches for most patterns.
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
11
Multistage Network : Omega Network
p processors and log2 p stages Each stage consists of a perfect shuffle
Sh
an
gh
ai Jia
o T
on
g U
niv
ersity
20
11
12
Multistage Network : Butterfly
ButterFly Network