Constraint-based evaluation of hypergraph and graph networks

Most of the common direct multicomputer networks, such as the torus and binary n-cube, are based on graph topologies. This paper presents the results of a comparative analysis of these topologies with a new class of regular hypergraph topologies, called Distributed Crossbar Switch Hypermeshes (DCSHs). Taking into account relative implementation cost, the analysis considers the different channel bandwidth constraints which apply in different possible realisations, such as pure VSLI and multi-chip technologies. Furthermore, it uses realistic assumptions, that have been ignored in previous similar studies, such as the inclusion of routing delays through intermediate nodes and the use of pipeline-bit transmission to lower the effects of long wires. The analysis concludes, that in many circumstances, the hypermesh has superior performance characteristics to the torus and binary n-cube.