Efficient single-node broadcast in wormhole-routed multicomputers: A network-partitioning approach

San Yuan Wang*, Yu-Chee Tseng, Chin Wen Ho

*Corresponding author for this work

研究成果: Conference article同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
文章編號5465327
頁(從 - 到)178-185
頁數8
期刊IEEE Symposium on Parallel and Distributed Processing - Proceedings
DOIs
出版狀態Published - 1 十二月 1996
事件Proceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA
持續時間: 23 十月 199626 十月 1996

指紋 深入研究「Efficient single-node broadcast in wormhole-routed multicomputers: A network-partitioning approach」主題。共同形成了獨特的指紋。

引用此