On the design of hypermesh interconnection networks for multicomputers

Mohamed Ould-Khaoua, L. M. Mackenzie

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Topology, routing algorithm, and router structure are among the most important factors that greatly influence network performance. This paper assesses the interaction of these elements on two related but distinct types of multicomputer networks, the binary n-cube (or cube) and the hypermesh. The analysis will show that the topological properties of the hypermesh confer an important advantage over the cube that makes the former a promising option for use in high-performance multicomputers. The hypermesh can use simple routing algorithms and cheap routers with little performance penalty. The cube, on the other hand, is constrained to the use of a specific routing algorithm and complex routers to take advantage of its rich connectivity.

Original languageEnglish
Pages (from-to)779-792
Number of pages14
JournalJournal of Systems Architecture
Volume46
Issue number9
Publication statusPublished - Jul 2000

Fingerprint

Routing algorithms
Routers
Network performance
Topology

Keywords

  • Binary n-Cube
  • Graph
  • Hypergraph
  • Hypermesh
  • Multicomputer network
  • Parallel processing
  • Performance evaluation
  • Router structure
  • Routing algorithm

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

On the design of hypermesh interconnection networks for multicomputers. / Ould-Khaoua, Mohamed; Mackenzie, L. M.

In: Journal of Systems Architecture, Vol. 46, No. 9, 07.2000, p. 779-792.

Research output: Contribution to journalArticle

@article{72704885d6d74b07beae1ebfe1d34356,
title = "On the design of hypermesh interconnection networks for multicomputers",
abstract = "Topology, routing algorithm, and router structure are among the most important factors that greatly influence network performance. This paper assesses the interaction of these elements on two related but distinct types of multicomputer networks, the binary n-cube (or cube) and the hypermesh. The analysis will show that the topological properties of the hypermesh confer an important advantage over the cube that makes the former a promising option for use in high-performance multicomputers. The hypermesh can use simple routing algorithms and cheap routers with little performance penalty. The cube, on the other hand, is constrained to the use of a specific routing algorithm and complex routers to take advantage of its rich connectivity.",
keywords = "Binary n-Cube, Graph, Hypergraph, Hypermesh, Multicomputer network, Parallel processing, Performance evaluation, Router structure, Routing algorithm",
author = "Mohamed Ould-Khaoua and Mackenzie, {L. M.}",
year = "2000",
month = "7",
language = "English",
volume = "46",
pages = "779--792",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "9",

}

TY - JOUR

T1 - On the design of hypermesh interconnection networks for multicomputers

AU - Ould-Khaoua, Mohamed

AU - Mackenzie, L. M.

PY - 2000/7

Y1 - 2000/7

N2 - Topology, routing algorithm, and router structure are among the most important factors that greatly influence network performance. This paper assesses the interaction of these elements on two related but distinct types of multicomputer networks, the binary n-cube (or cube) and the hypermesh. The analysis will show that the topological properties of the hypermesh confer an important advantage over the cube that makes the former a promising option for use in high-performance multicomputers. The hypermesh can use simple routing algorithms and cheap routers with little performance penalty. The cube, on the other hand, is constrained to the use of a specific routing algorithm and complex routers to take advantage of its rich connectivity.

AB - Topology, routing algorithm, and router structure are among the most important factors that greatly influence network performance. This paper assesses the interaction of these elements on two related but distinct types of multicomputer networks, the binary n-cube (or cube) and the hypermesh. The analysis will show that the topological properties of the hypermesh confer an important advantage over the cube that makes the former a promising option for use in high-performance multicomputers. The hypermesh can use simple routing algorithms and cheap routers with little performance penalty. The cube, on the other hand, is constrained to the use of a specific routing algorithm and complex routers to take advantage of its rich connectivity.

KW - Binary n-Cube

KW - Graph

KW - Hypergraph

KW - Hypermesh

KW - Multicomputer network

KW - Parallel processing

KW - Performance evaluation

KW - Router structure

KW - Routing algorithm

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

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

M3 - Article

AN - SCOPUS:0346444742

VL - 46

SP - 779

EP - 792

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 9

ER -