All-to-all personalized communication in a wormhole-routed torus

Yu Chee Tseng, Sandeep Gupta

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper, we consider this problem in a torus of any dimension with the wormhole-routing capability. We propose complete exchange algorithms that use optimal numbers of phases (if each side of the tori is a multiple of eight) or asymptotically optimal numbers of phases (otherwise). Interestingly, in order to achieve this, we only make weak assumptions - that a node is capable of sending and receiving at most one message at a time, and the network is capable of supporting the dimension-ordered (or e-cube) minimum routing.

Original languageEnglish (US)
Pages (from-to)498-505
Number of pages8
JournalIEEE Transactions on Parallel and Distributed Systems
Volume7
Issue number5
DOIs
StatePublished - 1996
Externally publishedYes

Fingerprint

Wormhole
Torus
Wormhole Routing
Exchange Algorithm
Communication
Parallel processing systems
Asymptotically Optimal
Parallel Computing
Regular hexahedron
Routing
Vertex of a graph
Heart

Keywords

  • All-to-all personalized communication
  • Collective communication
  • Complete exchange
  • Multicomputer network
  • Parallel computing
  • Torus
  • Wormhole routing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

All-to-all personalized communication in a wormhole-routed torus. / Tseng, Yu Chee; Gupta, Sandeep.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 5, 1996, p. 498-505.

Research output: Contribution to journalArticle

@article{576eb969d318455f9bb29948c3d0b14e,
title = "All-to-all personalized communication in a wormhole-routed torus",
abstract = "All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper, we consider this problem in a torus of any dimension with the wormhole-routing capability. We propose complete exchange algorithms that use optimal numbers of phases (if each side of the tori is a multiple of eight) or asymptotically optimal numbers of phases (otherwise). Interestingly, in order to achieve this, we only make weak assumptions - that a node is capable of sending and receiving at most one message at a time, and the network is capable of supporting the dimension-ordered (or e-cube) minimum routing.",
keywords = "All-to-all personalized communication, Collective communication, Complete exchange, Multicomputer network, Parallel computing, Torus, Wormhole routing",
author = "Tseng, {Yu Chee} and Sandeep Gupta",
year = "1996",
doi = "10.1109/71.503775",
language = "English (US)",
volume = "7",
pages = "498--505",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - All-to-all personalized communication in a wormhole-routed torus

AU - Tseng, Yu Chee

AU - Gupta, Sandeep

PY - 1996

Y1 - 1996

N2 - All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper, we consider this problem in a torus of any dimension with the wormhole-routing capability. We propose complete exchange algorithms that use optimal numbers of phases (if each side of the tori is a multiple of eight) or asymptotically optimal numbers of phases (otherwise). Interestingly, in order to achieve this, we only make weak assumptions - that a node is capable of sending and receiving at most one message at a time, and the network is capable of supporting the dimension-ordered (or e-cube) minimum routing.

AB - All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper, we consider this problem in a torus of any dimension with the wormhole-routing capability. We propose complete exchange algorithms that use optimal numbers of phases (if each side of the tori is a multiple of eight) or asymptotically optimal numbers of phases (otherwise). Interestingly, in order to achieve this, we only make weak assumptions - that a node is capable of sending and receiving at most one message at a time, and the network is capable of supporting the dimension-ordered (or e-cube) minimum routing.

KW - All-to-all personalized communication

KW - Collective communication

KW - Complete exchange

KW - Multicomputer network

KW - Parallel computing

KW - Torus

KW - Wormhole routing

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

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

U2 - 10.1109/71.503775

DO - 10.1109/71.503775

M3 - Article

AN - SCOPUS:0030145290

VL - 7

SP - 498

EP - 505

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 5

ER -