Title :
Tightly Connected Hierarchical Interconnection Networks for Parallel Processors
Author :
Breznay, Peter Thomas ; Lopez, Mario Alberto
Author_Institution :
University of Denver, Denver CO
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.
Keywords :
Computer science; Cost function; Hypercubes; Joining processes; Mathematics; Multiprocessor interconnection networks; Network topology; Parallel processing; Polynomials; Routing;
Conference_Titel :
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location :
Syracuse, NY, USA
Print_ISBN :
0-8493-8983-6
DOI :
10.1109/ICPP.1993.178