In this paper, a network-partitioning scheme for single-node broadcasting on wormhole-routed networks is proposed. To broadcast a message, the scheme works in three phases. First, a number of data-distributing networks (DDNs), which can work independently, are constructed. Then the message is evenly divided into sub-messages each being sent to a representative node in one DDN. Second, the sub-messages are broadcast on the DDNs concurrently. Finally, a number of data-collecting networks (DCNs), which can work independently too, are constructed. Then concurrently on each DCN the sub-messages are re-collected and combined into the original message. One interesting issue is on the definition of independent, in the sense of worm-hole routing. DDNs and DCNs. We show how to apply this scheme to tori, meshes, and hypercubes. Thorough analyses and experiments 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.
|Number of pages||8|
|Journal||IEEE Symposium on Parallel and Distributed Processing - Proceedings|
|State||Published - 1 Dec 1996|
|Event||Proceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA|
Duration: 23 Oct 1996 → 26 Oct 1996