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 Citations (Scopus)

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

Fingerprint

Parallel processing systems
Bandwidth
Communication

ASJC Scopus subject areas

  • Engineering(all)

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.

Efficient scheme for complete exchange in 2D tori. / Tseng, Yu Chee; Gupta, Sandeep; Panda, Dhabaleswar K.

IEEE Symposium on Parallel and Distributed Processing - Proceedings. ed. / Anon. IEEE, 1995. p. 532-536.

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

Tseng, YC, Gupta, S & Panda, DK 1995, Efficient scheme for complete exchange in 2D tori. in Anon (ed.), IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE, pp. 532-536, Proceedings of the IEEE 9th International Parallel Processing Symposium, Santa Barbara, CA, USA, 4/25/95.
Tseng YC, Gupta S, Panda DK. Efficient scheme for complete exchange in 2D tori. In Anon, editor, IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE. 1995. p. 532-536
Tseng, Yu Chee ; Gupta, Sandeep ; Panda, Dhabaleswar K. / Efficient scheme for complete exchange in 2D tori. IEEE Symposium on Parallel and Distributed Processing - Proceedings. editor / Anon. IEEE, 1995. pp. 532-536
@inproceedings{ed4a70235cf44b7e9dea8908323ffca5,
title = "Efficient scheme for complete exchange in 2D tori",
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.",
author = "Tseng, {Yu Chee} and Sandeep Gupta and Panda, {Dhabaleswar K.}",
year = "1995",
language = "English (US)",
pages = "532--536",
editor = "Anon",
booktitle = "IEEE Symposium on Parallel and Distributed Processing - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Efficient scheme for complete exchange in 2D tori

AU - Tseng, Yu Chee

AU - Gupta, Sandeep

AU - Panda, Dhabaleswar K.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

AN - SCOPUS:0029237794

SP - 532

EP - 536

BT - IEEE Symposium on Parallel and Distributed Processing - Proceedings

A2 - Anon, null

PB - IEEE

ER -