首页> 外文会议>International symposium on Physical design >Improved algorithms for link-based non-tree clock networks for skew variability reduction
【24h】

Improved algorithms for link-based non-tree clock networks for skew variability reduction

机译:基于链接的非树时钟网络的改进算法,可减少时滞变化

获取原文

摘要

In the nanometer VLSI technology, the variation effects like manufacturing variation, power supply noise, temperature etc. become very significant. As one of the most vital nets in any synchronous VLSI chip, the Clock Distribution Network (CDN) is especially sensitive to these variations. Recently proposed link-based non-tree [1] addresses this problem by constructing a non-tree that is significantly more tolerant to variations when compared to a clock tree. Although the two algorithms proposed in [1] are effective in reducing the skew variability, they have a few drawbacks including high complexity, lengthy links and uneven link distribution across the clock network. In this paper, we propose two new algorithms that can overcome these disadvantages. The effectiveness of the proposed algorithms has been validated using HSPICE based Monte Carlo simulations. Experimental results show that the new algorithms are able to achieve the same or better skew reduction with an average of 5% wire length increase when compared to the 15% wire length increase of the existing algorithms in [1]. Moreover, the new algorithms scale extremely well to big clock networks, i.e., the bigger the clock network, the less overall link cost (less than 2% for the biggest benchmark we have).
机译:在纳米VLSI技术中,诸如制造变化,电源噪声,温度等的变化效果变得非常显着。作为所有同步VLSI芯片中最重要的网络之一,时钟分配网络(CDN)对这些变化特别敏感。最近提出的基于链接的非树[1]通过构造一个非树来解决此问题,该非树与时钟树相比更能容忍变化。尽管在[1]中提出的两种算法在减少时滞变化方面是有效的,但是它们也有一些缺点,包括高复杂度,较长的链路以及整个时钟网络的链路分布不均。在本文中,我们提出了两种可以克服这些缺点的新算法。使用基于HSPICE的蒙特卡洛模拟已经验证了所提出算法的有效性。实验结果表明,与[1]中现有算法的线长增加15%相比,新算法能够以平均5%的线长增加实现相同或更好的偏斜减小。而且,新算法可很好地扩展到大型时钟网络,即时钟网络越大,总体链路成本就越低(对于我们拥有的最大基准测试,其成本不到2%)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号