Constraint-based evaluation of hypergraph and graph networks

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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

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
Volume4
Issue number2-3 SPEC. ISS.
DOIs
Publication statusPublished - May 15 1996

Fingerprint

Hypergraph
N-cube
Topology
Torus
Evaluation
Graph in graph theory
Binary
Multicomputers
Comparative Analysis
Switch
Routing
Chip
Pipelines
Inclusion
Bandwidth
Switches
Wire
Costs
Vertex of a graph

Keywords

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

ASJC Scopus subject areas

  • Modelling and Simulation

Cite this

Constraint-based evaluation of hypergraph and graph networks. / Ould-Khaoua, M.; Mackenzie, L. M.; Sutherland, R. J.; Sotudeh, R.

In: Simulation Practice and Theory, Vol. 4, No. 2-3 SPEC. ISS., 15.05.1996, p. 119-140.

Research output: Contribution to journalArticle

Ould-Khaoua, M. ; Mackenzie, L. M. ; Sutherland, R. J. ; Sotudeh, R. / Constraint-based evaluation of hypergraph and graph networks. In: Simulation Practice and Theory. 1996 ; Vol. 4, No. 2-3 SPEC. ISS. pp. 119-140.
@article{c1cb3e9d1a674b9dbbfe4ac128a6e6f3,
title = "Constraint-based evaluation of hypergraph and graph networks",
abstract = "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.",
keywords = "Binary n-cubes, Graphs, Hypergraphs, Hypermeshes, Multicomputers, Performance modelling, Queueing theory, Technology, Tori, Wormhole routing",
author = "M. Ould-Khaoua and Mackenzie, {L. M.} and Sutherland, {R. J.} and R. Sotudeh",
year = "1996",
month = "5",
day = "15",
doi = "10.1016/0928-4869(95)00043-7",
language = "English",
volume = "4",
pages = "119--140",
journal = "Simulation Modelling Practice and Theory",
issn = "1569-190X",
publisher = "Elsevier",
number = "2-3 SPEC. ISS.",

}

TY - JOUR

T1 - Constraint-based evaluation of hypergraph and graph networks

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

AU - Sutherland, R. J.

AU - Sotudeh, R.

PY - 1996/5/15

Y1 - 1996/5/15

N2 - 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.

AB - 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.

KW - Binary n-cubes

KW - Graphs

KW - Hypergraphs

KW - Hypermeshes

KW - Multicomputers

KW - Performance modelling

KW - Queueing theory

KW - Technology

KW - Tori

KW - Wormhole routing

UR - http://www.scopus.com/inward/record.url?scp=0030143682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030143682&partnerID=8YFLogxK

U2 - 10.1016/0928-4869(95)00043-7

DO - 10.1016/0928-4869(95)00043-7

M3 - Article

AN - SCOPUS:0030143682

VL - 4

SP - 119

EP - 140

JO - Simulation Modelling Practice and Theory

JF - Simulation Modelling Practice and Theory

SN - 1569-190X

IS - 2-3 SPEC. ISS.

ER -