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

Yu-Chee Tseng*, Sandeep K.S. Gupta

*Corresponding author for this work

Research output: Contribution to journalArticle

42 Scopus citations

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
Pages (from-to)498-505
Number of pages8
JournalIEEE Transactions on Parallel and Distributed Systems
Volume7
Issue number5
DOIs
StatePublished - 1 Dec 1996

Keywords

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

Fingerprint Dive into the research topics of 'All-to-all personalized communication in a wormhole-routed torus'. Together they form a unique fingerprint.

  • Cite this