Comparative evaluation of hypermesh and multi-stage interconnection networks

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

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

In a multicomputer network, the channel bandwidth is greatly constrained by implementation technology. Two important constraints have been identified in the literature, each appropriate for a particular technology: wiring density limits dominate in VLSI and pin-out in multiple-chip implementations. Most existing interconnection networks are categorized as either direct or indirect (multi-stage) topologies, the mesh and binary n-cube being examples of the former category, the omega and banyan networks of the latter. This paper argues that direct networks based on hypergraph topologies have characteristics which make them particularly appropriate for use in future high-performance parallel systems. The authors have recently introduced a regular multidimensional hypergraph network, called the Distributed Crossbar Switch Hypermesh (DCSH), which has topological properties that permit a relaxation of bandwidth constraints, and which has important topological and performance advantages over direct graph networks. This paper compares the DCSH to multi-stage networks, under both VLSI and multiple-chip technological constraints. The results suggest that in both cases, with a realistic model which includes routing delays through intermediate nodes, the DCSH exhibits superior performance across a wide range of traffic loads.

Original languageEnglish
JournalComputer Journal
Volume39
Issue number3
Publication statusPublished - 1996

Fingerprint

Switches
Topology
Bandwidth
Electric wiring

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Comparative evaluation of hypermesh and multi-stage interconnection networks. / Ould-Khaoua, M.; Mackenzie, L. M.; Sotudeh, R.

In: Computer Journal, Vol. 39, No. 3, 1996.

Research output: Contribution to journalArticle

@article{6267ab0e21ae4a9785f8fd2453f81511,
title = "Comparative evaluation of hypermesh and multi-stage interconnection networks",
abstract = "In a multicomputer network, the channel bandwidth is greatly constrained by implementation technology. Two important constraints have been identified in the literature, each appropriate for a particular technology: wiring density limits dominate in VLSI and pin-out in multiple-chip implementations. Most existing interconnection networks are categorized as either direct or indirect (multi-stage) topologies, the mesh and binary n-cube being examples of the former category, the omega and banyan networks of the latter. This paper argues that direct networks based on hypergraph topologies have characteristics which make them particularly appropriate for use in future high-performance parallel systems. The authors have recently introduced a regular multidimensional hypergraph network, called the Distributed Crossbar Switch Hypermesh (DCSH), which has topological properties that permit a relaxation of bandwidth constraints, and which has important topological and performance advantages over direct graph networks. This paper compares the DCSH to multi-stage networks, under both VLSI and multiple-chip technological constraints. The results suggest that in both cases, with a realistic model which includes routing delays through intermediate nodes, the DCSH exhibits superior performance across a wide range of traffic loads.",
author = "M. Ould-Khaoua and Mackenzie, {L. M.} and R. Sotudeh",
year = "1996",
language = "English",
volume = "39",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "3",

}

TY - JOUR

T1 - Comparative evaluation of hypermesh and multi-stage interconnection networks

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

AU - Sotudeh, R.

PY - 1996

Y1 - 1996

N2 - In a multicomputer network, the channel bandwidth is greatly constrained by implementation technology. Two important constraints have been identified in the literature, each appropriate for a particular technology: wiring density limits dominate in VLSI and pin-out in multiple-chip implementations. Most existing interconnection networks are categorized as either direct or indirect (multi-stage) topologies, the mesh and binary n-cube being examples of the former category, the omega and banyan networks of the latter. This paper argues that direct networks based on hypergraph topologies have characteristics which make them particularly appropriate for use in future high-performance parallel systems. The authors have recently introduced a regular multidimensional hypergraph network, called the Distributed Crossbar Switch Hypermesh (DCSH), which has topological properties that permit a relaxation of bandwidth constraints, and which has important topological and performance advantages over direct graph networks. This paper compares the DCSH to multi-stage networks, under both VLSI and multiple-chip technological constraints. The results suggest that in both cases, with a realistic model which includes routing delays through intermediate nodes, the DCSH exhibits superior performance across a wide range of traffic loads.

AB - In a multicomputer network, the channel bandwidth is greatly constrained by implementation technology. Two important constraints have been identified in the literature, each appropriate for a particular technology: wiring density limits dominate in VLSI and pin-out in multiple-chip implementations. Most existing interconnection networks are categorized as either direct or indirect (multi-stage) topologies, the mesh and binary n-cube being examples of the former category, the omega and banyan networks of the latter. This paper argues that direct networks based on hypergraph topologies have characteristics which make them particularly appropriate for use in future high-performance parallel systems. The authors have recently introduced a regular multidimensional hypergraph network, called the Distributed Crossbar Switch Hypermesh (DCSH), which has topological properties that permit a relaxation of bandwidth constraints, and which has important topological and performance advantages over direct graph networks. This paper compares the DCSH to multi-stage networks, under both VLSI and multiple-chip technological constraints. The results suggest that in both cases, with a realistic model which includes routing delays through intermediate nodes, the DCSH exhibits superior performance across a wide range of traffic loads.

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

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

M3 - Article

AN - SCOPUS:0001433781

VL - 39

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 3

ER -