Skip Navigation

The Computer Journal 1996 39(3):232-240; doi:10.1093/comjnl/39.3.232
© 1996 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (12)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ould-Khaoua, M.
Right arrow Articles by Sotudeh, R.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Comparative Evaluation of Hypermesh and Multi-stage Interconnection Networks

M. Ould-Khaoua1 *, L. M. MacKenzie2 § and R. Sotudeh1 *

1 School of Science and Technology, University of Teesside, Middlesbrough, TS1 3BA, UK, 2 Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, UK

In a multicomputer network, the channel bandwidth is greatly constrained by implementation technology. Two important constraints have been identified in the literature, each appropriate for a particular technology: wiring density limits dominate in VLSI and pin-out in multiple-chip implementations. Most existing interconnection networks are categorized as either direct or indirect (multi-stage) topologies, the mesh and binary n-cube being examples of the former category, the omega and banyan networks of the latter. This paper argues that direct networks based on hypergraph topologies have characteristics which make them particularly appropriate for use in future high-performance parallel systems. The authors have recently introduced a regular multi-dimensional hypergraph network, called the Distributed Crossbar Switch Hypermesh (DCSH), which has topological properties that permit a relaxation of bandwidth constraints, and which has important topological and performance advantages over direct graph networks. This paper compares the DCSH to multi-stage networks, under both VLSI and multiple-chip technological constraints. The results suggest that in both cases, with a realistic model which includes routing delays through intermediate nodes, the DCSH exhibits superior performance across a wide range of traffic loads.


Received September 9, 1994. revised November 8, 1995.

* School of Science and Technology, University of Teesside, Middlesbrough, TS1 3BA, UK Email: Mok{at}trees.ac.uk

§ Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, UK Email: lewis{at}dcs.glasgow.ac.uk


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
International Journal of High Performance Computing ApplicationsHome page
L. Mackenzie and M. Ould-Khaoua
Comparative Modeling of Network Topologies and Routing Strategies in Multicomputers
International Journal of High Performance Computing Applications, August 1, 2000; 14(3): 252 - 267.
[Abstract] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.