• DocumentCode
    1145233
  • Title

    Net-based force-directed macrocell placement for wirelength optimization

  • Author

    Alupoaei, Stelian ; Katkoori, Srinivas

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA
  • Volume
    10
  • Issue
    6
  • fYear
    2002
  • Firstpage
    824
  • Lastpage
    835
  • Abstract
    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.
  • Keywords
    VLSI; cellular arrays; circuit layout CAD; circuit optimisation; graph theory; integrated circuit layout; network routing; simulated annealing; I/O pin assignment; clique partitioning; coarse net-level placement; electrostatic rejection forces; force-directed net placement phase; grid-based heuristic; hierarchical macrocell placement; input register-transfer-level netlist; input/output pin assignment phase; iterative net terminal/cell placement phase; minimum weight bipartite matching; net clustering phase; net-based force-directed macrocell placement; net-cluster level floorplan; net-level floorplanning phase; overlap removal phase; placement generation; simulated annealing; weighted net dependency graph; wirelength optimization; Clustering algorithms; Costs; Design automation; Design methodology; Electrostatics; Macrocell networks; Minimization methods; Silicon; Simulated annealing; Wire;
  • fLanguage
    English
  • Journal_Title
    Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1063-8210
  • Type

    jour

  • DOI
    10.1109/TVLSI.2002.808453
  • Filename
    1178852