Previous | Next --- Slide 33 of 51
Back to Lecture Thumbnails

Can someone explain what $\mathcal{O}(\lg(n))$ radix means?


It means that if there are N nodes in the network, then each node is connected to O(lgN) others.

(In a ring, each node is connected to 2 others. In a mesh 4.)


How does the Hypercube topology compare with the tree described in the previous slides, besides the increased lg(N) factor of links in Hypercube, and uneven link widths in trees.


It seems like the hypercube isn't used as much lately - why is this? Is it because it is highly non-planar, meaning that it costs a lot to cross the wires?