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

Topology
Communication
Switches
Network performance

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.

Communication locality in hypermeshes and tori. / Ould-Khaoua, Mohamed; Sotudeh, Reza.

IEEE International Conference on Algorithms and Architectures for Parallel Processing. ed. / Anon. IEEE, 1996. p. 256-262.

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

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. IEEE, pp. 256-262, Proceedings of the 1996 IEEE 2nd International Conference on Algorithms & Architectures for Parallel Processing, ICA3PP, Singapore, Singapore, 6/11/96.
Ould-Khaoua M, Sotudeh R. Communication locality in hypermeshes and tori. In Anon, editor, IEEE International Conference on Algorithms and Architectures for Parallel Processing. IEEE. 1996. p. 256-262
Ould-Khaoua, Mohamed ; Sotudeh, Reza. / Communication locality in hypermeshes and tori. IEEE International Conference on Algorithms and Architectures for Parallel Processing. editor / Anon. IEEE, 1996. pp. 256-262
@inproceedings{f78f0631a30e4ffcb96cd602130680c9,
title = "Communication locality in hypermeshes and tori",
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.",
author = "Mohamed Ould-Khaoua and Reza Sotudeh",
year = "1996",
language = "English",
pages = "256--262",
editor = "Anon",
booktitle = "IEEE International Conference on Algorithms and Architectures for Parallel Processing",
publisher = "IEEE",

}

TY - GEN

T1 - Communication locality in hypermeshes and tori

AU - Ould-Khaoua, Mohamed

AU - Sotudeh, Reza

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

SP - 256

EP - 262

BT - IEEE International Conference on Algorithms and Architectures for Parallel Processing

A2 - Anon, null

PB - IEEE

ER -