首页> 外文期刊>Very Large Scale Integration (VLSI) Systems, IEEE Transactions on >Discrete Buffer and Wire Sizing for Link-Based Non-Tree Clock Networks
【24h】

Discrete Buffer and Wire Sizing for Link-Based Non-Tree Clock Networks

机译:基于链接的非树时钟网络的离散缓冲区和导线大小

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

摘要

Clock network is a vulnerable victim of variations as well as a main power consumer in many integrated circuits. Recently, link-based non-tree clock network attracts people's attention due to its appealing tradeoff between variation tolerance and power overhead. In this work, we investigate how to optimize such clock networks through buffer and wire sizing. A two-stage hybrid optimization approach is proposed. It considers the realistic constraint of discrete buffer/wire sizes and is based on accurate delay models. In order to provide reliable and efficient guidance for the optimization, we suggest to apply support vector machine (SVM)-based machine learning as a surrogate for expensive circuit-level simulation. Experimental results on benchmark circuits show that our sizing method can reduce clock skew by 45% on average with very small increase on power dissipation.
机译:时钟网络是变化的脆弱受害者,也是许多集成电路的主要功耗。最近,基于链接的非树时钟网络由于其在变化容忍度和功率开销之间的吸引人的折衷而吸引了人们的注意力。在这项工作中,我们研究如何通过缓冲区和导线尺寸优化此类时钟网络。提出了一种两阶段混合优化方法。它考虑了离散缓冲器/导线尺寸的实际约束,并基于精确的延迟模型。为了为优化提供可靠,有效的指导,我们建议应用基于支持向量机(SVM)的机器学习作为昂贵的电路级仿真的替代。在基准电路上的实验结果表明,我们的尺寸调整方法可以平均降低时钟偏斜45%,而功耗却增加很小。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号