A scalable multicast service for mesh networks

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234893

H. Xu, P. McKinley, L.M. Ni

引用次数: 8

Abstract

The authors investigate the scalability of a multicast algorithm designed for wormhole-routed mesh networks. The algorithm, known as the U-mesh algorithm, is shown to scale well in four ways: with the dimension of the mesh, with the number of destinations, with the system size, and with the problem size. It is demonstrated that the only factor that affects the multicast latency is the number of destinations and that, for a given number of destinations, the number of time steps required to perform a multicast operation is minimal. Performance measurements of implementations on a 64-node nCUBE-2 and a 168-node Symult 2010 are given.<>

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

用于网状网络的可扩展多播服务

研究了一种针对虫洞路由网状网络设计的组播算法的可扩展性。该算法被称为U-mesh算法，可以在四个方面进行很好的扩展:与网格的维度、目的地的数量、系统大小和问题大小有关。结果表明，影响组播延迟的唯一因素是目的地的数量，并且对于给定数量的目的地，执行组播操作所需的时间步数最小。给出了在64节点的nCUBE-2和168节点的Symult 2010上实现的性能测量。

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

求助全文

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

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量

期刊最新文献

MPPs, Amdahl's law, and comparing computers Benchmarking the CM-5 multicomputer Optical interconnects for multiprocessors cost performance trade-offs Parallel holographic image calculation and compression An overview of the nCUBE 3 supercomputer