首页> 外文会议>IEEE International Conference on Signal Processing, Communications and Computing >An improved minimal multicast routing algorithm for mesh-based Networks-on-Chip
【24h】

An improved minimal multicast routing algorithm for mesh-based Networks-on-Chip

机译:一种改进的基于网状片上网络的最小组播路由算法

获取原文

摘要

Microprocessor architectures trend to include more and more cores. To achieve high performance of multicore parallel computing's low-latency and high-throughput, Networks-on-Chip (NoC) are required. Multicast is also a key characteristic to meet the communications performances requirements. However, current multicast algorithm may not have enough ability to ensure communication performance. We propose a new distributed multicast routing algorithm using the shortest path to each destination, meanwhile focusing on minimizing the link usage. By building a tree of fully-used shared path and appending other destinations to the tree, we can obtain the minimal link usage multicast tree. The performance results show that, for an 8×8 mesh topology, at 0.05 injection rates, our scheme reduced 45% of latency than RPM.
机译:微处理器架构趋向于包含越来越多的内核。为了实现多核并行计算的低延迟和高吞吐量的高性能,需要片上网络(NoC)。组播也是满足通信性能要求的关键特征。但是,当前的多播算法可能没有足够的能力来确保通信性能。我们提出了一种新的分布式多播路由算法,该算法使用到达每个目的地的最短路径,同时着重于最大程度地减少链路使用。通过构建完全使用的共享路径的树并将其他目标附加到树上,我们可以获得最小链路使用率的多播树。性能结果表明,对于8×8网格拓扑,在0.05注入速率下,我们的方案比RPM减少了45%的延迟。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号