Go backward to
Static Connection Networks
Go up to
Top
Go forward to
Dynamic Connection Networks
Static Connection Networks
Trees: degree
k
, depth
d
,
N=k
d
-1
nodes.
Degree:
K+1
.
Diameter:
2(d-1)
approx.
2
log
k
N
Bisection width: 1!
(hot spot!)
Edge length: not constant.
Root becomes communication bottleneck.
Fat Tree
"Branches get thicker toward the root".
Channel width increases toward the root.
Communication bottleneck is avoided.
Example: Connection Machine CM-5.
Fat trees are also popular topologies.
Author:
Wolfgang Schreiner
Last modification: November 15, 1996