Optimality and Scalability Study--- Motivation - ISPD的最优性与可扩展性研究——动机——ISPD.pptVIP

下载本文档

4
0
约7.99千字
约 31页
2018-06-27 发布于福建
举报
版权申诉

Optimality and Scalability Study--- Motivation - ISPD的最优性与可扩展性研究——动机——ISPD.ppt

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

Optimality and Scalability Study--- Motivation - ISPD的最优性与可扩展性研究——动机——ISPD

Jason Cong ASPDAC03 Optimality, Scalability and Stability study of Partitioning and Placement Algorithms Jason Cong, Michail Romesis, Min Xie UCLA Computer Science Department Overview Motivation and related work Our contribution Construction of Partitioning Examples with Known Upper bound Construction of Placement Examples with Known Upper bound Optimality, Scalability and Stability study Conclusions and future work Overview Motivation and related work Our contribution Construction of Partitioning Examples with Known Upper bound Construction of Placement Examples with Known Upper bound Optimality, Scalability and Stability study Conclusions and future work Motivation Partitioning Motivation Placement Lack of significant progress in wirelength reduction Rate of reduction is about 5-10% every 2-3 years Latest developments in placement differ mainly in runtime Capo [A. Caldwell et al, 2000] Dragon [M. Wang et al, 2000] Mongrel [S. Hur et al, 2000] mPL [T. Chan et al, 2000] mPG [C. Chang et al, 2002] How much is the room for further improvement? Motivation Most work compare only with known heuristics Use real design based benchmarks ISPD98 [C. Alpert 1998] WSI [D. Ghosh et al, 1997] Use synthetic benchmarks circ and gen [M. D. Hutton et al, 1998] gnl [D. Stroobandt et al, 2000] Little understanding about the divergence from the optimal Related Work Quantified Suboptimality of VLSI Layout Heuristics [L. Hagen et al, 1995] Related Work Optimality and Scalability of Existing Placement Algorithms [C. Chang et al, 2003] Overview Motivation and related work Our contribution Construction of Partitioning Examples with Known Upper bound Construction of Placement Examples with Known Upper bound Optimality, Scalability and Stability study Conclusions and future work BEKU Construction Example Cutsize improved to 4 after FM Construction of Multiway Partitioning Examples with Known Upper Bounds (MEKU) Divide the nodes into m partitions of equal size Create B net