On the performance merits of bypass channels in hypermeshes and k-ary n-cubes

S. Loucif, M. Ould-Khaoua, L. M. Mackenzie

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Low-dimensional k-ary n-cubes have been popular in recent multicomputers. These networks, however, suffer from high switching delays due to their high message distance. To overcome this problem, Dally has proposed a variation, called express k-ary n-cubes, with express channels that allow non-local messages to partially bypass clusters of nodes within a dimension. K-ary n-cubes are graph topologies where a channel connects exactly two nodes. This study argues that hypergraph topologies, where a channel connects any number of nodes, thus providing total bypasses within a dimension, represent potential candidates for future high-performance networks. It presents a comparative analysis, of a regular hypergraph, referred to as the distributed crossbar switch hypermesh (DCSH), and the express k-ary n-cube. The analysis considers channel bandwidth constraints which apply in different implementation technologies. The results conclude that the DCSH's total bypass strategy yields superior performance characteristics to the partial bypassing of its express cube counterpart.

Original languageEnglish
Pages (from-to)62-72
Number of pages11
JournalComputer Journal
Volume42
Issue number1
Publication statusPublished - 1999

Fingerprint

Topology
Network performance
Switches
Bandwidth

ASJC Scopus subject areas

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

Cite this

On the performance merits of bypass channels in hypermeshes and k-ary n-cubes. / Loucif, S.; Ould-Khaoua, M.; Mackenzie, L. M.

In: Computer Journal, Vol. 42, No. 1, 1999, p. 62-72.

Research output: Contribution to journalArticle

@article{b4534e033b964481a8fb826a8ca5b207,
title = "On the performance merits of bypass channels in hypermeshes and k-ary n-cubes",
abstract = "Low-dimensional k-ary n-cubes have been popular in recent multicomputers. These networks, however, suffer from high switching delays due to their high message distance. To overcome this problem, Dally has proposed a variation, called express k-ary n-cubes, with express channels that allow non-local messages to partially bypass clusters of nodes within a dimension. K-ary n-cubes are graph topologies where a channel connects exactly two nodes. This study argues that hypergraph topologies, where a channel connects any number of nodes, thus providing total bypasses within a dimension, represent potential candidates for future high-performance networks. It presents a comparative analysis, of a regular hypergraph, referred to as the distributed crossbar switch hypermesh (DCSH), and the express k-ary n-cube. The analysis considers channel bandwidth constraints which apply in different implementation technologies. The results conclude that the DCSH's total bypass strategy yields superior performance characteristics to the partial bypassing of its express cube counterpart.",
author = "S. Loucif and M. Ould-Khaoua and Mackenzie, {L. M.}",
year = "1999",
language = "English",
volume = "42",
pages = "62--72",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "1",

}

TY - JOUR

T1 - On the performance merits of bypass channels in hypermeshes and k-ary n-cubes

AU - Loucif, S.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 1999

Y1 - 1999

N2 - Low-dimensional k-ary n-cubes have been popular in recent multicomputers. These networks, however, suffer from high switching delays due to their high message distance. To overcome this problem, Dally has proposed a variation, called express k-ary n-cubes, with express channels that allow non-local messages to partially bypass clusters of nodes within a dimension. K-ary n-cubes are graph topologies where a channel connects exactly two nodes. This study argues that hypergraph topologies, where a channel connects any number of nodes, thus providing total bypasses within a dimension, represent potential candidates for future high-performance networks. It presents a comparative analysis, of a regular hypergraph, referred to as the distributed crossbar switch hypermesh (DCSH), and the express k-ary n-cube. The analysis considers channel bandwidth constraints which apply in different implementation technologies. The results conclude that the DCSH's total bypass strategy yields superior performance characteristics to the partial bypassing of its express cube counterpart.

AB - Low-dimensional k-ary n-cubes have been popular in recent multicomputers. These networks, however, suffer from high switching delays due to their high message distance. To overcome this problem, Dally has proposed a variation, called express k-ary n-cubes, with express channels that allow non-local messages to partially bypass clusters of nodes within a dimension. K-ary n-cubes are graph topologies where a channel connects exactly two nodes. This study argues that hypergraph topologies, where a channel connects any number of nodes, thus providing total bypasses within a dimension, represent potential candidates for future high-performance networks. It presents a comparative analysis, of a regular hypergraph, referred to as the distributed crossbar switch hypermesh (DCSH), and the express k-ary n-cube. The analysis considers channel bandwidth constraints which apply in different implementation technologies. The results conclude that the DCSH's total bypass strategy yields superior performance characteristics to the partial bypassing of its express cube counterpart.

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

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

M3 - Article

VL - 42

SP - 62

EP - 72

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 1

ER -