个人简介 httpcsnjueducn~gchen.pptVIP

* ③ Tree The tree has nodes of degree 1 (leaves), 2 (root), 3 (interior nodes). So it is not symmetric. Short diameter: For depth k, the number of nodes is 2k - 1, and the diameter is 2k (or ~ 2 log N, at the same order as Hypercube). For example, a processor with 262,144 nodes would have diameter 512 in a mesh but only 36 in a tree. Bisection bandwidth is 1. It suffers from a serious bottleneck -- Solution : Fat Tree * ③ Fat Tree Fat-tree layout Fat-Tree Expand link bandwidth at each higher level B B B B/8 B/4 B/2 * ③ Fat Tree Leisersons fat-trees [Lei85] – built in CM-5. The Fat Tree ne