Ted Brown, Deniz Sarioz, et al.
SPIE Defense, Security, and Sensing 2007
We consider the problem of broadcasting multiple messages from one processor to many processors in the k-port model for message-passing systems. In such systems, processors communicate in rounds, where in every round, each processor can send k messages to k processors and receive k messages from k processors. In this paper, we first present a simple and practical algorithm based on variations of k complete k-ary trees. We then present an optimal algorithm up to an additive term of one for this problem for any number of processors, any number of messages, and any value for k.
Ted Brown, Deniz Sarioz, et al.
SPIE Defense, Security, and Sensing 2007
Felix Naumann, Ching-Tien Ho, et al.
Proceedings - International Conference on Data Engineering
Hagit Attiya, Amotz Bar-Noy, et al.
Journal of the ACM
Amotz Bar-Noy, Alain Mayer, et al.
SODA 1995