Nearly Optimal Algorithms for Broadcast on d-Dimensional All-Port and Wormhole-Routed Torus

In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the number of communication steps performed to broadcast a message. We present algorithms that achieve the following performance: i Tn = ddlog2d+1 ne+1 when n is odd, and ii Tn = ddlog2d+1n , 1e + dd=2e + 1 when n is even. The lower bound is ddlog2d+1 ne. Our algorithm is the rst 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 ei

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Jyh-Jong Tsay, Wen-Tsong Wang
• Keywords: Algorithms, Distributed And Parallel Computing, IPPS 1998, Optimal Algorithms, Wormhole Routing