A class of static and dynamic hierarchical interconnection networks
- Univ. of Denver, CO (United States)
A TCN is a hierarchical interconnection network where isomorphic clusters are connected using a complete graph at the highest level of hierarchy. We extend the concept of TCN to the dynamic domain and reduce the hardware complexity in the static domain. The resulting networks outperform both its non-hierarchical and hierarchical counterparts, while improving on the congestion and fault-tolerance characteristics of the latter; they also have optimal connectivity, high bisection width, low degree, cost, and diameter, and low average distance under both uniform and non-uniform traffic. For instance, with dynamic clusters we obtain the same delay as the corresponding non hierarchical multistage network at 1/2 the cost; while the maximum and average delays are typically 2/3 and 3/4 of those in a comparable HMIN, at approximately the same cost. In the static case, using hypercube clusters, the degree, diameter and cost are approximately 1/2, 3/4 and 3/8 of the same parameters in a comparable size hypercube; while the diameter and average distance are typically 1/2 and 3/4 of those in traditional HINs. In case of mesh clusters, the diameter and cost are reduced even further, by an amount proportional to their square root.
- OSTI ID:
- 98880
- Report Number(s):
- CONF-940856-; TRN: 94:008346-0012
- Resource Relation:
- Conference: 1994 international conference on parallel processing, St. Charles, IL (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Proceedings of the 1994 international conference on parallel processing. Volume 1: Architecture; Agrawal, D.P. [ed.]; PB: 330 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reliable designs for massively connected multiprocessors
Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)