We present an algorithm for scattering distinct messages, of arbitrary lengths, to the nodes of a heterogeneous cluster. We analyze our algorithm under the HiHCoHP model and find it to be within a small constant factor of optimal in communication speed.
The algorithm is generated under a very neat binomial scatter-tree
structure.
Last modified 9 October 2002