Issue No. 01 - January (1999 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.744837
<p><b>Abstract</b>—In this paper, a <it>network-partitioning</it> approach for one-to-all broadcasting on wormhole-routed networks is proposed. To broadcast a message, the scheme works in three phases. First, a number of <it>data-distributing networks</it> (<it>DDNs</it>), which can work independently, are constructed. Then the message is evenly divided into submessages, each being sent to a representative node in one DDN. Second, the submessages are broadcast on the DDNs concurrently. Finally, a number of <it>data-collecting networks</it> (<it>DCNs</it>), which can work independently too, are constructed. Then, concurrently on each DCN, the submessages are collected and combined into the original message. Our approach, especially designed for wormhole-routed networks, is conceptually similar but fundamentally very different from the traditional approach (e.g., [<ref rid="bibl00444" type="bib">4</ref>], [<ref rid="bibl004413" type="bib">13</ref>], [<ref rid="bibl004418" type="bib">18</ref>], [<ref rid="bibl004431" type="bib">31</ref>]) of using multiple <it>edge-disjoint spanning trees</it> in parallel for broadcasting in store-and-forward networks. One interesting issue is on the definition of <it>independent</it> DDNs and DCNs, in the sense of wormhole routing. We show how to apply this approach to tori, meshes, and hypercubes. Thorough analyses and comparisons based on different system parameters and configurations are conducted. The results do confirm the advantage of our scheme, under various system parameters and conditions, over other existing broadcasting algorithms.</p>
Collective communication, hypercube, interconnection network, mesh, one-to-all broadcast, parallel processing, torus, wormhole routing.
C. Ho, Y. Tseng and S. Wang, "Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach," in IEEE Transactions on Parallel & Distributed Systems, vol. 10, no. , pp. 44-61, 1999.