### 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 language | English |
---|---|

Pages (from-to) | 62-72 |

Number of pages | 11 |

Journal | Computer Journal |

Volume | 42 |

Issue number | 1 |

Publication status | Published - 1999 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*Computer Journal*,

*42*(1), 62-72.

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

Research output: Contribution to journal › Article

*Computer Journal*, vol. 42, no. 1, pp. 62-72.

}

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

AN - SCOPUS:0032640654

VL - 42

SP - 62

EP - 72

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 1

ER -