Tightly Connected Hierarchical Interconnection Networks for Parallel Processors

Authors:
Peter Thomas Breznay;Mario Alberto Lopez
Affiliations:
University of Denver, Denver CO;University of Denver, Denver CO
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Year:
1993

Citing 0
Cited 2

Efficient Routing and Broadcasting in Recursive Interconnection Networks

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
A Class of Static and Dynamic Hierarchical Interconnection Networks

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for constructing hierarchical in terconnection networks is presented. The method is based on connecting isomorphic clusters using a complete graph as the higher level network. Applying it to various classes of graphs, including hypercubes and meshes, results in networks with optimal connectivity, high bisection width, low degree, diameter and cost. With hypercube clusters, the degree, diameter and cost are approximately | , | and j of the same parameters in a comparable size hy percube. With mesh clusters, the performance parame ters are polynomially better than those in a similar size mesh.