Bo Hu
ABSTRACT
This paper presents a new congestion minimization technique for standard cell global placement. The most distinct feature of this approach is that it does not follow the traditional "estimate-then-eliminate" strategy. Instead, it avoids the excessive usage of routing resources by the "local" nets so that more routing resources are available for the uncertain "global" nets. The experimental results show that our new technique, SPARSE, achieves better routability than the traditional total wire length (Bounding Box) guided placers, which had been shown to deliver the best routability results among the placers optimizing different cost functions [2]. Another feature of SPARSE is the capability of allocating white space implicitly. SPARSE exploits the well known empirical Rent's rule and is able to improve the routability even more in the presence of white space. Compared to the most recent academic routability-driven placer Dragon[8], SPARSE is able to produce solutions with equal or better routability.
- C.-L. E. Cheng. "RISA: Accurate and Efficient Placement Routability Modeling". Proc. International Conference on Computer-Aided Design, pp. 690--695, 1994. Google Scholar
Digital Library
- M. Wang, X. Yang, and M. Sarrafzadeh. "Congestion Minimization During Placement", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems", vol. 19, no. 10, pp. 1140--1148, 2000. Google ScholarDigital Library
- W. Hou, H. Yu, X. Hong, Y. Cai, W. Wu, J. Gu and W. H. Kao. "A New Congestion-driven Placement Algorithm Based on Cell Inflation". Proc. Asia and South Pacific Design Automation Conference, pp. 605--608. 2001. Google ScholarDigital Library
- J. Lou, S. Krishnamoorthy, and H. S. Sheng. "Estimating Routing Congestion Using Probabilistic Analysis", Proc. International Symposium on Physical Design, pp. 112--117, 2001. Google ScholarDigital Library
- S. Mayrhofer and U. Lauther. "Congestion-driven Placement Using a New Multi-partitioning Heuristic", Proc. International Conference on Computer-Aided Design, pp. 332--335, 1990.Google ScholarCross Ref
- P. N. Parakh, R. B. Brown, and K. A. Sakallah. "Congestion Driven Quadratic Placement", Proc. Design Automation Conference, pp. 275--278, 1998. Google ScholarDigital Library
- X. Yang, R. Kastner, and M. Sarrafzadeh. "Congestion Reduction During Placement Based on Integer Programming", Proc. International Conference on Computer-Aided Design, pp. 573--576, 2001. Google ScholarDigital Library
- X. Yang, B-K. Choi, M. Sarrafzadeh. "Routability Driven White Space Allocation for Fixed-die Standard-cell Placement", Proc. International Symposium on Physical Design, pp. 42--47, 2002. Google ScholarDigital Library
- A. Rohe, U. Brenner. "An Effective Congestion Driven Placement Framework", Proc. International Symposium on Physical Design, pp. 6--11, 2002. Google ScholarDigital Library
- J.M. Kleinhans, G. Sigl, F.M. Johannes and K.J. Antreich, "GORDIAN: VLSI Placement by Quadratic Programming and Slicing Optimization", IEEE Trans. CAD, vol. 10, no. 3, Mar 1991, pp. 356--365.Google ScholarDigital Library
- A.E. Caldwell, A.B. Kahng, I.L. Markov, "Can Recursive Bisection Alone Produce Routable Placements?", Proc. Design Automation Conference, pp. 477--482, 2000. Google ScholarDigital Library
- G. Parthasarathy, M. Marek-Sadowska, A. Mukherjee, A. Singh, "Interconnect-Complexity Aware Placement for FPGA using Rent's Rule", Proc. of 3rd System Level Interconnect Prediction WorkShop, pp. 23--30, April, 2001. Google ScholarDigital Library
- A. Singh, G. Parthasarathy, M. Marek-Sadowska, "Interconnect-Resource Aware Placement for hierarchical FPGAs", Proc. International Conference on Computer-Aided Design, pp. 132--136, 2001. Google ScholarDigital Library
- "http://gigascale.org/bookshelf ".Google Scholar
Index Terms
- Congestion minimization during placement without estimation
Recommendations
An effective congestion driven placement framework
ISPD '02: Proceedings of the 2002 international symposium on Physical designWe present a fast but reliable way to detect routing criticalities in VLSI chips. In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. Different to previous approaches, we do not rerun ...
Congestion minimization during placement
Typical placement objectives involve reducing net-cut cost or minimizing wirelength. Congestion minimization is the least understood, however, it models routability most accurately. In this paper, we study the congestion minimization problem during ...
Blockage-aware terminal propagation for placement wirelength minimization
ICCAD '17: Proceedings of the 36th International Conference on Computer-Aided DesignWirelength is the most fundamental objective in placement because it also affects various placement metrics (routability, timing, etc.). Half-perimeter wirelength (HPWL) is a pervasive metric for circuit placement. However, preplaced blocks (i.e., ...
Comments