.png){kind=icon}
Return
Hypermeshes: implementation and performance
.png){kind=icon}
PRE
AI
DOI：10.1016/S1383-7621(02)00063-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2002 Published by Elsevier Science B.V.
Keywords:
parallel processing
multicomputers
interconnection networks
graphs
hypergraphs
virtual cut-through
performance analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
3.0K
Citations:
4.2K
Organization
No organization information available