Efficient communication primitives on hypercubes
Concurrency: Practice and Experience
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Circuit-Switched Broadcasting in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
Circuit-Switched Broadcasting in Torus and Mesh Networks
IEEE Transactions on Parallel and Distributed Systems
All-to-All Personalized Communication in a Wormhole-Routed Torus
IEEE Transactions on Parallel and Distributed Systems
A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus
IEEE Transactions on Computers
Optimal Multicast Communication in Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
All-to-all broadcast in torus with wormhole-like routing
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
| Hi-index | 0.00 |
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional n 脳 n 脳 ... 脳 n torus that supports all-port communication and wormhole routing. Let T(n) denote the number of communication steps performed to broadcast a message. We present algorithms that achieve the following performance: (i) T(n) = d驴log2d+1 n驴 + 1 when n is odd, and (ii) T(n) = d驴log2d+1 (n - 1)驴 + 驴d/2驴 + 1 when n is even. The lower bound is 驴d log2d+1 n驴. Our algorithm is the first one that works for arbitrary n, and is optimal up to the constant term. Previous algorithms with comparable performance only work for the case that either d is 2 or 3, or n is a power of 2d + 1. For special cases such as d = 2 or 3, we can improve the algorithm so that T(n) = d驴log2d+1 n驴 for any n.