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 language | English (US) |
|---|---|
| Title of host publication | IEEE Symposium on Parallel and Distributed Processing - Proceedings |
| Editors | Anon |
| Publisher | IEEE |
| Pages | 532-536 |
| Number of pages | 5 |
| State | Published - 1995 |
| Externally published | Yes |
| Event | Proceedings of the IEEE 9th International Parallel Processing Symposium - Santa Barbara, CA, USA Duration: Apr 25 1995 → Apr 28 1995 |
Other
| Other | Proceedings of the IEEE 9th International Parallel Processing Symposium |
|---|---|
| City | Santa Barbara, CA, USA |
| Period | 4/25/95 → 4/28/95 |
ASJC Scopus subject areas
- General Engineering