HTML version of Scripted Foils prepared 18 Sept 1995

Foil 46 Degree and Diameter of Hypercube and Tree Architectures

From Second set of lectures on CPS615 Parallel Computing Overview CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95. by Geoffrey C. Fox *
1 Hypercube compromises so both degree and diameter grow modestly. High degree implies hard to build -- low diameter improves communication
2 Tree has bottleneck at root(top). In fat tree address this as in CM5 by increasing bandwidth on links as one goes up the tree
Table Font Size

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Fri Aug 15 1997