Issue No. 08 - August (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.238484
<p>The operations of scattering and gathering in a network of processors involve one processor of the network (P/sub 0/) communicating with all other processors. In scattering, P/sub 0/ sends distinct messages to P/sub 0/. The authors consider networks that are trees of processors. Algorithms for scattering messages from and gathering messages to the processor that resides at the root of the tree are presented. The algorithms are quite general, in that the messages transmitted can differ arbitrarily in length; quite strong, in that they send messages along noncolliding paths, and hence do not require any buffering or queueing mechanisms in the processors; and quite efficient in that algorithms for scattering in general trees are optimal, the algorithm for gathering in a path is optimal and the algorithms for gathering in general trees are nearly optimal. The algorithms can easily be converted using spanning trees to efficient algorithms for scattering and gathering in networks of arbitrary topologies.</p>
message scattering; messages gathering; networks of processors; trees of processors; noncolliding paths; buffering; queueing mechanisms; spanning trees; distributed processing; multiprocessor interconnection networks; scheduling.
G. Pucci, A. Ranade, S. Bhatt and A. Rosenberg, "Scattering and Gathering Messages in Networks of Processors," in IEEE Transactions on Computers, vol. 42, no. , pp. 938-949, 1993.