Efficient scheme for complete exchange in 2D tori

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

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

8 Scopus citations


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
Pages (from-to)532-536
Number of pages5
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - 1 Jan 1995
EventProceedings of the IEEE 9th International Parallel Processing Symposium - Santa Barbara, CA, USA
Duration: 25 Apr 199528 Apr 1995

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

Cite this