Efficient scheme for complete exchange in 2D tori

Yu Chee Tseng, Sandeep Gupta, Dhabaleswar K. Panda

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

8 Scopus citations

Abstract

All-to-all personalized communication, or complete exchange, is at the heart of numerous applications in parallel computing. An efficient complete exchange algorithm is proposed for square 2 n × 2 n wormhole-routed tori. Previous work has only considered complete exchange algorithms for mesh networks. The proposed algorithm effectively uses the bisection bandwidth of a torus, which is twice that for an equal sized mesh, to achieve complete exchange in a time which is almost half of the (best known) complete exchange time on an equal sized mesh.

Original languageEnglish (US)
Title of host publicationIEEE Symposium on Parallel and Distributed Processing - Proceedings
Editors Anon
PublisherIEEE
Pages532-536
Number of pages5
StatePublished - 1995
Externally publishedYes
EventProceedings of the IEEE 9th International Parallel Processing Symposium - Santa Barbara, CA, USA
Duration: Apr 25 1995Apr 28 1995

Other

OtherProceedings of the IEEE 9th International Parallel Processing Symposium
CitySanta Barbara, CA, USA
Period4/25/954/28/95

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Efficient scheme for complete exchange in 2D tori'. Together they form a unique fingerprint.

  • Cite this

    Tseng, Y. C., Gupta, S., & Panda, D. K. (1995). Efficient scheme for complete exchange in 2D tori. In Anon (Ed.), IEEE Symposium on Parallel and Distributed Processing - Proceedings (pp. 532-536). IEEE.