...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of supercomputing >An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path
【24h】

An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path

机译：嵌入哈密顿路径的虫洞路由星图互连网络上基于树的高效组播算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Multicasting is an important issue for numerous applications in parallel and distributed computing. In multicasting, the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we propose an efficient and deadlock-free tree-based multi-cast routing scheme for wormhole-routed star graph networks with hamiltonian path. In our proposed routing scheme, the router is with the input-buffer-based asynchronous replication mechanism that requires extra hardware cost. Meanwhile, the router simultaneously sends incoming flits on more than one outgoing channel. We perform simulation experiments with the network latency and the network traffic. Experimental results show that the proposed scheme reduces multicast latency more efficiently than other schemes.
机译：对于并行和分布式计算中的许多应用程序，多播是一个重要的问题。在多播中，同一消息从源节点传递到任意数量的目标节点。星形图互连网络已被公认为是流行的超立方体网络的一种有吸引力的替代方法。在本文中，我们为具有哈密尔顿路径的虫洞路由星图网络提出了一种高效且无死锁的基于树的组播路由方案。在我们提出的路由方案中，路由器具有基于输入缓冲区的异步复制机制，这需要额外的硬件成本。同时，路由器同时在多个出站通道上发送入站信息。我们使用网络延迟和网络流量执行模拟实验。实验结果表明，该方案比其他方案更有效地减少了组播延迟​​。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号