Net-based force-directed macrocell placement for wirelength optimization

被引:11
作者
Alupoaei, S [1 ]
Katkoori, S [1 ]
机构
[1] Univ S Florida, Dept Comp Sci & Engn, Tampa, FL 33620 USA
基金
美国国家科学基金会;
关键词
force-directed method; macrocell placement; net clustering; net length minimization; soft macrocells;
D O I
10.1109/TVLSI.2002.808453
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:824 / 835
页数:12
相关论文
共 28 条
  • [1] Faster minimization of linear wirelength for global placement
    Alpert, CJ
    Chan, TF
    Kahng, AB
    Markov, IL
    Mulet, P
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1998, 17 (01) : 3 - 13
  • [2] Bakoglu H., 1990, CIRCUITS INTERCONNEC
  • [3] On wirelength estimations for row-based placement
    Caldwell, AE
    Kahng, AB
    Mantik, S
    Markov, IL
    Zelikovsky, A
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1999, 18 (09) : 1265 - 1278
  • [4] Chang YC, 2000, DES AUT CON, P458
  • [5] Cheng C., 2000, INTERCONNECT ANAL SY
  • [6] CHONG P, 2000, P DES AUT C, P1
  • [7] Performance optimization of VLSI interconnect layout
    Cong, J
    He, L
    Koh, CK
    Madden, PH
    [J]. INTEGRATION-THE VLSI JOURNAL, 1996, 21 (1-2) : 1 - 94
  • [8] Eisenmann H, 1998, 1998 DESIGN AUTOMATION CONFERENCE, PROCEEDINGS, P269, DOI 10.1109/DAC.1998.724480
  • [9] Floorplanning using a tree representation
    Guo, PN
    Takahashi, T
    Cheng, CK
    Yoshimura, T
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2001, 20 (02) : 281 - 289
  • [10] KAHNG AB, 1995, OPTIMAL INTERCONNECT, pCH4