Tightly Connected Hierarchical Interconnection Networks

In this work we introduce a new method for constructing hierarchical interconnection networks. This approach uses a fully connected higher-level network to connect isomorphic cluster networks, motivated by the base observation that theoretically the clique graph (crossbar) is the best interconnect. The resulting concept is the Tightly Connected Hierarchical Interconnection network, or TCN. We discuss singly as well as multiply linked TCNs and show that single-level TCNs possess superior topological parameters and efficiently implement normal hypercube algorithms, including PRAM simulation. Especially efficient interconnection networks can be built by applying the TCN concept recursively. We prove that recursive TCN architectures exhibit sub-logarithmic topological parameters, reaching asymptotic optimum. The extension of the TCN method to the dynamic domain results in the Tightly Connected Multi-Stage Interconnection Network or TCMIN architecture. The TCMIN interconnect significantly improves the parameters of both the same-size non-hierarchical and hierarchical MINs, while it also has much better congestion and fault-tolerance characteristics than its traditional counterparts.

Autorentext

Peter T. Breznay obtained his Ph. D. degree from the University of Denver. His research interests are in the fields of parallel and distributed architectures and algorithms, network dynamics and artificial neural networks. He is currently a professor of Computer Science at the Computer Science Department of the University of Wisconsin - Green Bay.