首页> 外文期刊>ACM Transactions on Design Automation of Electronic Systems >Destination-Based Congestion Awareness for Adaptive Routing in 2D Mesh Networks
【24h】

Destination-Based Congestion Awareness for Adaptive Routing in 2D Mesh Networks

机译:二维网状网络中自适应路由的基于目的地的拥塞意识

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The choice of routing algorithm plays a vital role in the performance of on-chip interconnection networks. Adaptive routing is appealing because it offers better latency and throughput than oblivious routing, especially under nonuniform and bursty traffic. The performance of an adaptive routing algorithm is determined by its ability to accurately estimate congestion in the network. In this regard, maintaining global congestion state using a separate monitoring network offers better congestion visibility into distant parts of the network compared to solutions relying only on local congestion. However, the main challenge in designing such routing schemes is to keep the logic and bandwidth overhead as low as possible to fit into the tight power, area, and delay budgets of on-chip routers. In this article, we propose a minimal destination-based adaptive routing strategy (DAR), where every node estimates the delay to every other node in the network, and routing decisions are based on these per-destination delay estimates. DAR outperforms Regional Congestion Awareness (RCA), the best previously known adaptive routing algorithm that uses nonlocal congestion state. The performance improvement is brought about by maintaining fine-grained per-destination delay estimates in DAR that are more accurate than regional congestion metrics measured in RCA. The increased accuracy is a consequence of the fact that the per-destination delay estimates are not corrupted by congestion on links outside the admissible routing paths to the destination. A scalable version of DAR, referred to as SDAR, is also proposed for minimizing the overheads associated with DAR in large network topologies. We show that DAR outperforms local adaptive routing by up to 79% and RCA by up to 58% in terms of latency on SPLASH-2 benchmarks. DAR and SDAR also outperform existing adaptive and oblivious routing algorithms in latency and throughput under synthetic traffic patterns on 8 × 8 and 16 × 16 mesh topologies, respectively.
机译:路由算法的选择在片上互连网络的性能中起着至关重要的作用。自适应路由之所以吸引人,是因为它比遗忘路由提供了更好的延迟和吞吐量,尤其是在流量不均匀和突发的情况下。自适应路由算法的性能取决于其准确估计网络中拥塞的能力。在这方面,与仅依赖本地拥塞的解决方案相比,使用单独的监视网络维护全局拥塞状态可提供对网络遥远部分的更好拥塞可见性。但是,设计此类路由方案的主要挑战是保持逻辑和带宽开销尽可能低,以适应片上路由器的紧凑功率,面积和延迟预算。在本文中,我们提出了一种基于最小目标的自适应路由策略(DAR),其中每个节点都估计到网络中每个其他节点的延迟,而路由决策则基于这些每个目标的延迟估计。 DAR的性能优于区域拥塞意识(RCA),这是以前使用非本地拥塞状态的最佳已知自适应路由算法。通过在DAR中保留细粒度的每个目标延迟估计来实现性能改进,该估计比在RCA中测量的区域拥塞度量更为准确。准确性的提高是以下事实的结果:每个目的地的延迟估计不会因在到目的地的允许路由路径之外的链路上的拥塞而损坏。还提出了可扩展版本的DAR(称为SDAR),以最大程度地减少大型网络拓扑结构中与DAR相关的开销。我们显示,就SPLASH-2基准测试的延迟而言,DAR的性能比本地自适应路由高出79%,RCA高达58%。在8×8和16×16网格拓扑的综合流量模式下,DAR和SDAR在等待时间和吞吐量方面也分别优于现有的自适应和遗忘路由算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号