【24h】

Unicast-Based Multicast Communication in Wormhole-Routed All-Port Mesh Networks

机译:虫洞路由全端口网状网络中基于单播的组播通信

获取原文
获取原文并翻译 | 示例

摘要

This paper presents an efficient method for multicasting in dimension-ordered wormhole-routed all-port 2D mesh networks. The proposed method is composed of three distinct phases, namely multicasting on columns (MoC), multicasting on rows (MoR), and multicasting for representative nodes (MfRN). For the MoC phase, a new hierarchical grouping based multicast algorithm is presented. For both MoR and MfRN phases, any depth contention-free recursive tripling based multicast algorithm can be implemented. Consequently, two different multicast algorithms with different complexities are considered. By taking advantage of the all-port model and the distance insensitivity of wormhole routing, it is shown that the proposed method can reduce the number of the message passing steps by up to 37.50% and the multicast latency by up to 30.40% compared to the U-mesh algorithm. Furthermore it is proved to be depth contention-free.
机译:本文提出了一种在维数有序虫洞路由全端口2D网状网络中进行组播的有效方法。所提出的方法包括三个不同的阶段,即列上的多播(MoC),行上的多播(MoR)和代表节点的多播(MfRN)。对于MoC阶段,提出了一种新的基于层次分组的多播算法。对于MoR和MfRN阶段,都可以实现任何基于无深度竞争的递归三重组播算法。因此,考虑了具有不同复杂度的两种不同的组播算法。通过利用全端口模型和虫洞路由的距离不敏感性,表明该方法可以将消息传递步骤数减少37.50%,将组播延迟减少30.40%。 U网格算法。此外,它被证明是没有深度争用的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号