Hypermeshes: implementation and performance

  • Authors:

  • S. Loucif;M. Ould-Khaoua;A. Al-Ayyoub

  • Affiliations:

  • Department of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK;Department of Computing Science, University of Glasgow, Glasgow G12 8RZ, UK;Department of Computer Science and Information Systems, School of Computer and Information Technology, Jordan University of Science and Technology, Irbid 22110, Jordan

  • Venue:
  • Journal of Systems Architecture: the EUROMICRO Journal
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Common multicomputer networks, including the torus, mesh, and hypercube, are graph topologies where a channel interconnects exactly two nodes. Hypergraphs are generalisations of the graph model, where a channel interconnects an arbitrary number of nodes. The spanning-bus hypercube is a well-known network that belongs to the hypergraph family. Regular multidimensional hypergraphs, also known as hypermeshes, have been proposed as potential alternatives to traditional graph networks for future multicomputers due to their superior topological and performance features. This paper compares the different schemes that have been proposed in the literature for implementing the hypermesh. The results reveal that one particular version of the hypermesh, known as the distributed crossbar switch hypermesh, provides the best performance when implementation costs are taken into account.