
10.4 Interconnection Topologies 773
FIGURE 10.9 Binary trees. Trees are a simple network with logarithmic depth that can
be laid out efficiently in 2D by using an
H-tree
configuration. Routing is simple, and they
contain trees as subnetworks. However, the bisection bandwidth is only 0(1).
and i be the position of the most significant 1 in
R.
The route from node
A
to node B
is simply i + 1 hops up followed by i + 1 hops down, with the direction at each
branch specified by the low-order i + 1 bits of
B.
Formally a complete indirect binary tree is a network of 2N - 1 nodes organized
as d
+
1 = log
2
N
+
1 levels. Host nodes occupy level 0 and ar ...