Issue No. 12 - December (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.334901
<p>Broadcast, referring to a process of information dissemination in a distributed systemwhereby a message originating from a certain node is sent to all other nodes in thesystem, is a very important issue in distributed computing. All-to-all broadcast means theprocess by which every node broadcasts its certain piece of information to all othernodes. In this paper, we first develop the optimal all-to-all broadcast scheme for thecase of one-port communication, which means that each node can only send out onemessage in one communication step, and then, extend our results to the case ofmulti-port communication, i.e., k-port communication, meaning that each node can sendout k messages in one communication step. We prove that the proposed schemes areoptimal for the model considered in the sense that they not only require the minimalnumber of communication steps, but also incur the minimal number of messages.</p>
Index Termsdistributed processing; computer networks; optimal NODUP all-to-all broadcast schemes;distributed computing systems; information dissemination; distributed system; one-portcommunication; k-port communication
K. Wu, P. Yu and M. Chen, "Optimal NODUP All-to-All Broadcast Schemes in Distributed Computing Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 1275-1285, 1994.