A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation
Dynamic broadcast is a communication problem where each node in a parallel computer generates packets to be broadcast to all the other nodes according to a certain random process. The lower bound on the average time required by any oblivious dynamic broadcast algorithm in an ndimensional hypercube is Ωn+ 1 1,ρ when packets are generated according to a Poisson process, where ρ is the load factor. The best previous algorithms, however, only achieve Ω n 1,ρ time, which is suboptimal by a factor ofdoi:10.1109/fmpc.1999.750612 fatcat:yus7utagonc6zklf2zwvx5jhje