首页> 外文期刊>IEEE transactions on very large scale integration (VLSI) systems >Net-based force-directed macrocell placement for wirelength optimization
【24h】

Net-based force-directed macrocell placement for wirelength optimization

机译:基于网络的力导向宏单元放置,用于线长优化

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

摘要

We propose a net-based hierarchical macrocell placement such that "net placement" dictates the cell placement. The proposed approach has four phases. 1) Net clustering and net-level floorplanning phase: a weighted net dependency graph is built from the input register-transfer-level netlist. Clusters of nets are then formed by clique partitioning and a net-cluster level floorplan is obtained by simulated annealing. The floorplan defines the regions where the nets in each cluster must be routed. 2) Force-directed net placement phase: a force-directed net placement is performed which yields a coarse net-level placement without consideration for the cell placement. 3) Iterative net terminal and cell placement phase: a force-directed net and cell placement is performed iteratively. The terminals of a net are free to move under the influence of forces in the quest for optimal wire length. The cells with high net length cost may "jump" out of local minima by ignoring the rejection forces. The overlaps are reduced by employing electrostatic rejection forces. 4) Overlap removal and input/output (I/O) pin assignment phase: Overlap removal is performed by a grid-based heuristic. I/O pin assignment is performed by minimum-weight bipartite matching. Placements generated by the proposed approach are compared with those generated by Cadence Silicon Ensemble and the O-tree floorplanning algorithm. On average, the proposed approach improves both the total wire length and longest wire length by 18.9% and 28.3%, respectively, with an average penalty of 5.6% area overhead.
机译:我们提出了一个基于网络的分层宏单元放置,以便“网络放置”决定了单元放置。拟议的方法分为四个阶段。 1)网络聚类和网络级别的布局规划阶段:从输入寄存器转移级别的网络列表构建加权的网络依存关系图。然后,通过集群划分形成网络集群,并通过模拟退火获得网络集群级别的平面布置图。平面图定义了每个群集中的网络必须路由的区域。 2)力导向的净放置阶段:执行力导向的净放置,这会产生粗略的净水平放置,而无需考虑单元放置。 3)迭代网络终端和单元放置阶段:强制执行网络和单元迭代放置。在寻求最佳导线长度时,网的端子可在力的影响下自由移动。具有高净长度成本的单元格可能会通过忽略排斥力而“跳出”局部最小值。通过采用静电排斥力来减少重叠。 4)重叠移除和输入/输出(I / O)引脚分配阶段:重叠移除由基于网格的启发式算法执行。 I / O引脚分配通过最小重量的双向匹配来执行。将所提出的方法生成的布局与Cadence Silicon Ensemble和O树布局规划算法生成的布局进行比较。平均而言,所提出的方法将总导线长度和最长导线长度分别提高了18.9%和28.3%,平均开销为5.6%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号