Constraint-based evaluation of hypergraph and graph networks

M. Ould-Khaoua*, L. M. Mackenzie, R. J. Sutherland, R. Sotudeh

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)119-140
Number of pages22
JournalSimulation Practice and Theory
Issue number2-3 SPEC. ISS.
Publication statusPublished - May 15 1996
Externally publishedYes


  • Binary n-cubes
  • Graphs
  • Hypergraphs
  • Hypermeshes
  • Multicomputers
  • Performance modelling
  • Queueing theory
  • Technology
  • Tori
  • Wormhole routing

ASJC Scopus subject areas

  • Modelling and Simulation


Dive into the research topics of 'Constraint-based evaluation of hypergraph and graph networks'. Together they form a unique fingerprint.

Cite this