Tightly Connected Hierarchical Interconnection Networks for Parallel Processors

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… (More)
DOI: 10.1109/ICPP.1993.178

Topics

  • Presentations referencing similar topics