首页> 外文学位 >VLSI placement algorithms for better detailed routability.
【24h】

VLSI placement algorithms for better detailed routability.

机译:VLSI布局算法可提供更好的详细布线能力。

获取原文
获取原文并翻译 | 示例

摘要

The placement step in VLSI physical design flow deals with the problem of determining the locations of circuit elements, which are typically represented as rectangles of various sizes, with the goal of easing the difficulty of the next step in the flow, namely, routing, which realizes the physical connections between these circuit elements. Consequently, the placement step has a direct effect on the total wirelength of the realized connections of a circuit and perhaps more important, the feasibility of realizing these connections, or the routability of the placement solution. This thesis focuses on developing placement algorithms for generating placement solutions with shorter routed wirelength and better routability. Instead of using only an intermediate global routing solution for evaluation, we always assess the quality of a placement solution with a detailed routing solution in terms of the total routed wirelength and the total number of routing violations.;The placement step is conventionally performed in two phases: global placement followed by detailed placement. We propose an analytical global placer for routability-driven placement of fixed-size circuits. By applying a new mathematical formulation, the global placer manages to alleviate pin congestion when distributing cells. Moreover, we adopt a scaled smoothing method to reduce the negative influence of macro blocks. On average, detailed routing solutions with smaller wirelength and fewer design rule violations can be achieved on placement results generated with the proposed global placer.;For detailed placement, we focus on sliding window techniques, which rearrange cells in local windows and do not perturb routability much. Specifically, we develop a Mixed Integer Programming (MIP) model that allows the detailed placement of windows containing more cells to be optimized more efficiently. In particular, by ignoring some integer variables in the model, the solution time for the optimization of windows from large-scale mixed-size circuits can be shortened greatly. With the application of our detailed placer on the placement results of other detailed placement techniques, routed wirelength can be reduced while similar level of detailed-routability is retained for most circuits.
机译:VLSI物理设计流程中的放置步骤涉及确定电路元件位置的问题,这些位置通常表示为各种尺寸的矩形,目的是减轻流程中下一步的困难,即布线,实现这些电路元件之间的物理连接。因此,放置步骤对电路的已实现连接的总线长有直接影响,并且可能更重要的是,实现这些连接的可行性或放置解决方案的可布线性。本文的重点是开发布局算法,以生成具有更短布线长度和更好布线性的布局解决方案。我们不仅仅使用中间的全局布线解决方案进行评估,而是始终通过总布线长度和布线违规总数来评估带有详细布线解决方案的布局解决方案的质量。阶段:全局放置,然后进行详细放置。我们提出了一种分析性全球布局器,用于由可路由性驱动的固定尺寸电路布局。通过应用新的数学公式,全局布局器可以减轻分配细胞时的引脚拥塞。此外,我们采用缩放平滑方法来减少宏块的负面影响。平均而言,使用拟议的全球布局器生成的布局结果可以实现具有较小线长和较少违反设计规则的详细布线解决方案。许多。具体来说,我们开发了一种混合整数编程(MIP)模型,该模型允许更有效地优化包含更多单元格的窗口的详细放置。特别是,通过忽略模型中的一些整数变量,可以大大缩短用于大规模混合电路的窗口优化的求解时间。通过将我们的详细布局器应用于其他详细布局技术的布局结果,可以减少布线长度,同时对大多数电路保留相似水平的详细可布线性。

著录项

  • 作者

    Li, Shuai.;

  • 作者单位

    Purdue University.;

  • 授予单位 Purdue University.;
  • 学科 Computer engineering.;Electrical engineering.
  • 学位 Ph.D.
  • 年度 2014
  • 页码 133 p.
  • 总页数 133
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号