An efficient algorithm for multiple simultaneous broadcasts in the hypercube

Abstract

We analyze the following problem: Each of K nodes of the d-cube wishes (at the same time)to broadcast a packet to all hypercube nodes. We present a simple distributed algorithm for performing this task efficiently for any value of K and for any K-tuple of broadcasting nodes, and some variations of this algorithm that apply to special cases. In particular, we obtain a very easily implementable algorithm for the multinode broadcast task (K = 2 d), which comes within a factor of 2 from the optimal.

Packet Routing in Fixed-Connection Networks: A Survey

“…The problem also arises in practice, when overlapping global communication with local computation, e.g., when solving first-order recurrence equations, X i+1 =A } X i , where X is distributed to different nodes. Although dynamic broadcasting may be based on spanning trees [297,298], an approach based on developing efficient partial multinode broadcasting algorithms (used as subroutines) is more general and achieves the widest range of stability with asymptotically optimal latency [321,323].…”