ppt课件-channel routing（通道路由）.pptVIP

下载本文档

55
0
约5.49千字
约 26页
2017-01-25 发布于四川
举报
版权申诉

ppt课件-channel routing（通道路由）.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文档。上传文档

General Routing Overview and Channel Routing Shantanu Dutt ECE Dept. UIC References and Copyright (cont.) Slides used: (Modified by Shantanu Dutt when necessary) [?Sarrafzadeh] ? Majid Sarrafzadeh, 2001; Department of Computer Science, UCLA [?Sherwani] ? Naveed A. Sherwani, 1992 (companion slides to [She99]) [?Keutzer] ? Kurt Keutzer, Dept. of EECS, UC-Berekeley/~niraj/ee244/index.htm [?Gupta] ? Rajesh Gupta UC-Irvine/~rgupta/ics280.html [?Kang] ? Steve Kang, UIUC /ece482/ [?Bazargan] ? Kia Bazargan Routing Problem Given a placement, and a fixed number of metal layers, find a valid pattern of horizontal and vertical wires that connect the terminals of the nets Levels of abstraction: Global routing Detailed routing Objectives Cost components: Area (channel width) – min congestion in prev levels helped Wire delays – timing minimization in previous levels Number of layers (fewer layers ? less expensive) Additional cost components: number of bends, vias ?Bazargan Metal layer 1 Via Routing Anatomy Top view 3D view Metal layer 2 Metal layer 3 SymbolicLayout Note: Colors usedin this slide are notstandard ?Bazargan Global vs. Detailed Routing Global routing Input: detailed placement, with exact terminal locations Determine “channel” (routing region) for each net Objective: minimize area (congestion), and timing (approximate) Detailed routing Input: channels and approximate routing from the global routing phase Determine the exact route and layers for each net Objective: valid routing, minimize area (congestion), meet timing constraints Additional objectives: min via, power Figs. [?Sherwani] Taxonomy of VLSI Routers [?Keutzer] Graph Search Steiner Iterative Hierarchical Greedy Left-Edge River Switchbox Channel Maze Line Probe Line Expansion Restricted General Purpose Clock Specialized Power/Gnd Routers Detailed Global Maze Global Routing Stages Routing region definition Routing region ordering Steiner