Multi-node broadcasting in hypercubes and star graphs

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1997-12-10 DOI:10.1109/ICAPP.1997.651479

Y. Tseng

引用次数: 10

Abstract

In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algorithm to solve this problem using asymptotically optimal or near-optimal transmission time.

查看原文本刊更多论文

超立方体和星图中的多节点广播

在超立方体或星图中，给定位于未知位置的未知数量的节点，每个节点都打算广播消息，我们提出了一种有效的路由算法，使用渐近最优或接近最优的传输时间来解决这个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing

自引率

0.00%

发文量