首页> 外文会议>IEEE International Conference on Integrated Circuits and Microsystems >Link-Sharing: Regional Congestion Aware Routing in 2D NoC by Propagating Congestion Information on Idle Links
【24h】

Link-Sharing: Regional Congestion Aware Routing in 2D NoC by Propagating Congestion Information on Idle Links

机译:链路共享:通过在空闲链路上传播拥塞信息,在2D NoC中实现区域拥塞感知路由

获取原文

摘要

Congestion aware routing plays an important role in balancing the Networks-on-Chip (NoC) traffic load to diminish the communication cost. Theoretically, the more detailed network congestion information is collected, the better routing decision can be made. However, the congestion information propagation methods employed by state of the art designs usually have drawbacks like long update interval, nonnegligible link wiring overhead, or can only propagate abbreviated congestion information. Noticing that NoC link utilization rate is typically low, we propose a Link-Sharing method which propagates congestion information on the normal data links during their idle cycles. Be benefited from the wide link bandwidth, Link-Sharing enables each router to have a more detailed and timely updated network status overview than counterpart congestion aware routing algorithms, and thus can make more sophisticated routing decision to avoid the congested area. When compared with the counterpart methods, Link-Sharing is able to improve the NoC saturation point by up to 20.8 % with negligible area and power overhead.
机译:拥塞感知路由在平衡片上网络(NoC)流量负载以降低通信成本方面起着重要作用。从理论上讲,收集越详细的网络拥塞信息,就可以做出更好的路由决策。但是,现有技术设计所采用的拥塞信息传播方法通常具有缺点,例如更新间隔长,链路布线开销不可忽略,或者只能传播简短的拥塞信息。考虑到NoC链路利用率通常较低,我们提出了一种链路共享方法,该方法在正常数据链路的空闲周期内传播拥塞信息。受益于较宽的链路带宽,Link-Sharing使每个路由器比对应的拥塞感知路由算法更详细,及时地更新网络状态概述,从而可以做出更复杂的路由决策来避免拥塞区域。与其他方法相比,Link-Sharing可以将NoC饱和点提高高达20.8%,而面积和功耗却可以忽略不计。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号