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.
|Number of pages||5|
|Journal||IEEE Symposium on Parallel and Distributed Processing - Proceedings|
|State||Published - 1 Jan 1995|
|Event||Proceedings of the IEEE 9th International Parallel Processing Symposium - Santa Barbara, CA, USA|
Duration: 25 Apr 1995 → 28 Apr 1995