Issue No. 11 - November (2005 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.129
Xiaotong Zhuang , IEEE
Vincenzo Liberatore , IEEE Computer Society
<p><b>Abstract</b>—A novel broadcast technique for wormhole-routed parallel computers based on recursion is presented in this paper. It works by partitioning the interconnection graph into a number of higher-level subgraphs. Then, we identify the <it>Transmission SubGraph (TSG)</it> in each subgraph. Both the higher-level subgraphs and the <it>TSG</it>s are recursively defined, i.e., we split each level <tmath>i</tmath> subgraph into several level <tmath>i+1</tmath> subgraphs and identify-level <tmath>i+1</tmath><it>TSG</it>s accordingly. We first split and scatter the source message into the <it>TSG</it> of the original graph. Next, in each recursive round message transmissions are from lower-level <it>TSG</it>s to higher-level <it>TSG</it>s and all transmissions at the same level happen concurrently. The algorithm proceeds recursively from lower-level subgraphs to higher level subgraphs until each highest-level subgraph (a single node) gets the complete message. We have applied this general paradigm to a number of topologies including two or higher dimension mesh/torus and hypercube. Our results show considerable improvements over all other algorithms for a wide range of message sizes under both one-port and all-port models.</p>
Hypercube, massive parallel computer, mesh, one-to-all broadcast, parallel processing, torus, wormhole routing.
X. Zhuang and V. Liberatore, "A Recursion-Based Broadcast Paradigm in Wormhole Routed Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 16, no. , pp. 1034-1052, 2005.