【24h】

Novel Routing Algorithm for Minimum on Delay with Process Variation and Congestion in Asynchronous NoC

机译:异步NoC中具有过程变化和拥塞的最小时延的新型路由算法

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

摘要

A novel routing algorithm is presented to avoid the impact of process variation and congestion for asynchronous NoC design. Process variation Delay and Congestion aware Routing (PDCR) is proposed as adaptive, low cost and scalable routing algorithm. The performance of PDCR with process variation is determined as compared with different routing algorithms under various traffic patterns. The saturation throughput and average message delay are used as performance metrics. PDCR outperforms different adaptive routing algorithms using various traffic patterns. PDCR can achieve up to 12% - 32% average message delay lower than that of other routing algorithms. Moreover, the proposed scheme yields improvements in saturation throughput by up to 11% - 82% compared with other adaptive routing algorithms.
机译:提出了一种新颖的路由算法,以避免异步NoC设计过程中的过程变化和拥塞的影响。提出了过程变化时延和拥塞感知路由(PDCR)作为自适应,低成本和可扩展的路由算法。与各种流量模式下的不同路由算法相比,确定了具有过程变化的PDCR的性能。饱和吞吐量和平均消息延迟用作性能指标。 PDCR使用各种流量模式胜过不同的自适应路由算法。与其他路由算法相比,PDCR可以使平均消息延迟降低多达12%-32%。此外,与其他自适应路由算法相比,该方案可将饱和吞吐量提高11%-82%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号