Porosity Aware Buffered Steiner Tree Constrction孔隙度感知的缓冲Steiner树构造.pptVIP

Porosity Aware Buffered Steiner Tree Constrction孔隙度感知的缓冲Steiner树构造.ppt

  1. 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Porosity Aware Buffered Steiner Tree Constrction孔隙度感知的缓冲Steiner树构造

Porosity Aware Buffered Steiner Tree Construction C. Alpert G. Gandham S. Quay IBM Corp Outline Introduction and Previous work Problem formulation Algorithm Experimental results Conclusion Buffer Insertion Improve timing Drive long wire Shield load from critical path Van Ginneken’s Algorithm Given tree topology fixed Find optimal solution at fast speed If There Are Big Blockages Previous Works Simultaneous tree construction and buffer insertion Buffer blockage driven Recursively Merging and Embedding [Cong and Yuan, DAC 00] Graph-based[Tang, et al., ICCAD 01] General purpose SP-Tree [Hrkic and Lillis, ISPD 02] Excellent solution quality High complexity Sequential tree construction + buffer insertion Adaptive blockage avoidance [Hu, et al., ISPD 02] Very good solution quality Practical computation speed If There Are Many Small Blockages Porosity Has to Be Considered Handling small blockages will slow down computation Buffers in dense region may be spiraled away No previous work handles porosity directly Express Porosity through Tile Graph For a tile g A(g): tile area a(g): usage area d(g) = a(g)/A(g) Porosity cost is d2(g), if a buffer is placed in g Problem Formulation Porosity-aware Buffered Steiner Tree Problem: Given A net N = {v0, v1, …, vn} Load capacitance c(vi) and required arrival time q(vi) Tile graph G(VG, EG) Construct a Steiner tree T(V,E), such that Required arrival time q(vi) are satisfied Total porosity cost is minimized Observation Easy to deal with node-to-node path Congestion can be avoided by rerouting without affecting timing Hard to deal with Steiner nodes Moving Steiner nodes may degrade timing Basic Strategy Construct a timing driven Steiner tree regardless porosity Adjust Steiner nodes simultaneously with length-based buffer insertion Adjustment range need to be restrained A Steiner node is moved only when buffer is needed there Length-based Buffer Insertion Simple buffering following rule of thumb Capacitance load of driver/buff

您可能关注的文档

文档评论(0)

erterye + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档