Communication locality in hypermeshes and tori

Mohamed Ould-Khaoua, Reza Sotudeh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

The torus has been a popular topology for multicomputers due to its ease of implementation. Existing networks, such as the torus, are graph topologies, where a channel connects exactly two nodes. This paper argues that hypergraph topologies, where a channel connects any number of nodes, are potential candidates for future high-performance multicomputer networks. The paper assesses the support of a multi-dimensional hypergraph, referred to as the Distributed Crossbar Switch Hypermesh (DCSH), and the torus for communication locality. The results show that DCSH is a more general structure as it supports more efficiently a wide range of traffic patterns.

Original languageEnglish
Title of host publicationIEEE International Conference on Algorithms and Architectures for Parallel Processing
Editors Anon
PublisherIEEE
Pages256-262
Number of pages7
Publication statusPublished - 1996
EventProceedings of the 1996 IEEE 2nd International Conference on Algorithms & Architectures for Parallel Processing, ICA3PP - Singapore, Singapore
Duration: Jun 11 1996Jun 13 1996

Other

OtherProceedings of the 1996 IEEE 2nd International Conference on Algorithms & Architectures for Parallel Processing, ICA3PP
CitySingapore, Singapore
Period6/11/966/13/96

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Ould-Khaoua, M., & Sotudeh, R. (1996). Communication locality in hypermeshes and tori. In Anon (Ed.), IEEE International Conference on Algorithms and Architectures for Parallel Processing (pp. 256-262). IEEE.