An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube

Stamoulis, G.D. and J.N. Tsitsiklis, An efficient algorithm for multiple simultaneous broadcasts in the hypercube, Information Processing Letters 46 (1993) 219-224. 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 an easily implementable algorithm for the multinode broadcast task (K = 2d), which comes within a factor of 2 from the optimal.

[1]  Emmanouel A. Varvarigos,et al.  Dynamic Broadcasting in Parallel Computing , 1995, IEEE Trans. Parallel Distributed Syst..

[2]  Allan Borodin,et al.  Routing, merging and sorting on parallel models of computation , 1982, STOC '82.

[3]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[4]  John N. Tsitsiklis,et al.  Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..

[5]  Sanjeev Saxena,et al.  On Parallel Prefix Computation , 1994, Parallel Process. Lett..

[6]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .