An Optimal Routing Scheme for Multiple Broadcast

The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingto a certain random process, such as a Poisson process. The lower bounds on the average reception delay required by any oblivious dynamic broadcast algorithm in a d-dimensional hypercube are d + 1 1, when packets are generated according to a Poisson process, where is the load factor. The best previous algorithms for hypercubes only achieve d 1, average reception delay. In this paper, we propose dynamic broadcast algorithms that require optimal Od + 1 1, average reception delay in d-dimensional

• Type: Conference
• Year: 1998
• Where: ICPADS
• Authors: Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
• Keywords: Average Reception Delay, Distributed And Parallel Computing, Dynamic Broadcast, Dynamic Broadcast Algorithms, ICPADS 1998