A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
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 thisdoi:10.1109/ipps.1996.508148 dblp:conf/ipps/Bar-NoyH96 fatcat:unhkgj5fx5dmzhk5byfna4cph4