Fault-tolerant multicast with traffic-balancing in hypercubes

研究成果: Paper同行評審

1 引文 斯高帕斯(Scopus)

摘要

Multicast is an important interprocessor communication pattern existing in various parallel application algorithms. This paper proposes a new multicast algorithm for hypercube computers that not only minimizes the number of hops required for delivery of the message and keeps a least possible amount of traffic, but also takes into consideration of balancing traffic among the active processors to maximize the parallelism in communication. Our algorithm has a time complexity of O(nN) for fault-tolerant multicasting in a hyper-cube of N = 2 n processors containing an arbitrary number of faulty processors.

原文English
頁面415-421
頁數7
出版狀態Published - 1996
對外發佈
事件Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China
持續時間: 12 6月 199614 6月 1996

Conference

ConferenceProceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
城市Beijing, China
期間12/06/9614/06/96

指紋

深入研究「Fault-tolerant multicast with traffic-balancing in hypercubes」主題。共同形成了獨特的指紋。

引用此