Communication locality in hypermeshes and tori

Mohamed Ould-Khaoua; Reza Sotudeh

Communication locality in hypermeshes and tori

Mohamed Ould-Khaoua^*, Reza Sotudeh

^*Corresponding author for this work

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Citations (SciVal)

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 language	English
Title of host publication	IEEE International Conference on Algorithms and Architectures for Parallel Processing
Editors	Anon
Publisher	IEEE
Pages	256-262
Number of pages	7
Publication status	Published - 1996
Event	Proceedings of the 1996 IEEE 2nd International Conference on Algorithms & Architectures for Parallel Processing, ICA³PP - Singapore, Singapore Duration: Jun 11 1996 → Jun 13 1996

Other

Other	Proceedings of the 1996 IEEE 2nd International Conference on Algorithms & Architectures for Parallel Processing, ICA³PP
City	Singapore, Singapore
Period	6/11/96 → 6/13/96

ASJC Scopus subject areas

Computer Science(all)
Engineering(all)

Cite this

@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",

note = "Proceedings of the 1996 IEEE 2nd International Conference on Algorithms & Architectures for Parallel Processing, ICA<sup>3</sup>PP ; Conference date: 11-06-1996 Through 13-06-1996",

}

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

AN - SCOPUS:0030400596

SP - 256

EP - 262

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

A2 - Anon, null

PB - IEEE

T2 - Proceedings of the 1996 IEEE 2nd International Conference on Algorithms & Architectures for Parallel Processing, ICA<sup>3</sup>PP

Y2 - 11 June 1996 through 13 June 1996

ER -

Communication locality in hypermeshes and tori

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this