Timing-Driven Analytical Placement According to Expected Cell Distribution Range

被引:0
|
作者
Lin, Jai-Ming [1 ]
Chang, You-Yu [1 ]
Huang, Wei-Lun [1 ]
机构
[1] Natl Cheng Kung Univ, Tainan, Taiwan
关键词
Physical design; Placement; Timing; DESIGNS;
D O I
10.1145/3626184.3633318
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Since the multilevel framework with the analytical approach has been proven as a promising method to handle the very-large-scale integration (VLSI) placement problem, this paper presents two techniques including a pin-connectivity-aware cluster score function and identification of expected object distribution ranges to further improve the coarsening and refinement stages of this framework. Moreover, we extend the proposed analytical placement method to consider timing in order to speed up design convergence. To optimize timing without increasing wirelength, our approach only increases the weights of timing-critical nets, where the weight of a net is estimated according to the associated timing slack and degree. Besides, we propose a new equation to update net weights based on their historical values to maintain the stability of the net-based timing-driven placement approach. Experimental results demonstrate that the proposed analytical placement approach with new techniques can actually improve wirelength of the classic approach. Moreover, our TDP can get much better WNS and TNS than the previous timing-driven placers such as DREAMPlace4.0 and Differentiable TDP.
引用
收藏
页码:177 / 184
页数:8
相关论文
共 50 条
  • [21] A parallel circuit-partitioned algorithm for timing-driven standard cell placement
    Chandy, JA
    Banerjee, P
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1999, 57 (01) : 64 - 90
  • [22] Methods of improving rout ability in timing-driven placement
    Hou, WT
    Hong, XL
    Wu, WM
    Cai, YC
    2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, 2001, : 110 - 113
  • [23] Timing-driven placement based on path topology analysis
    Cheng, F
    Mao, J
    Li, XC
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (08): : 2227 - 2230
  • [24] A novel net weighting algorithm for timing-driven placement
    Kong, T
    IEEE/ACM INTERNATIONAL CONFERENCE ON CAD-02, DIGEST OF TECHNICAL PAPERS, 2002, : 172 - 176
  • [25] Enhancing timing-driven FPGA placement for pipelined netlists
    Eguro, Ken
    Hauck, Scott
    2008 45TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2008, : 34 - 37
  • [26] An analytic placer for mixed-size placement and timing-driven placement
    Kahng, AB
    Wang, Q
    ICCAD-2004: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, IEEE/ACM DIGEST OF TECHNICAL PAPERS, 2004, : 565 - 572
  • [27] An analytical timing-driven placer for modern heterogeneous FPGAs
    Lin, Zhifeng
    Chen, Yilu
    Xie, Yanyue
    Chen, Chuandong
    Yu, Jun
    Chen, Jianli
    JOURNAL OF SUPERCOMPUTING, 2025, 81 (01):
  • [28] A Novel Net Weighting Algorithm for Power and Timing-Driven Placement
    Chentouf, Mohamed
    Ismaili, Zine El Abidine Alaoui
    VLSI DESIGN, 2018,
  • [29] Clock-Tree-Aware Incremental Timing-Driven Placement
    Livramento, Vinicius
    Netto, Renan
    Guth, Chrystian
    Guntzel, Jose Luis
    Dos Santos, Luiz C. V.
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2016, 21 (03)
  • [30] Timing-driven placement for heterogeneous field programmable gate array
    Hu, Bo
    IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN, DIGEST OF TECHNICAL PAPERS, ICCAD, 2006, : 551 - 556