Minsik Cho
ABSTRACT
In VLSI placement, legalization is an essential step where the overlaps between gates/macros must be removed. In this paper, we introduce a history-based legalization algorithm with min-cost network flow optimization. We find a legal solution with the minimum deviation from a given placement to fully honor/preserve the initial placement, by solving a gate-centric network flow formulation in an iterative manner. In order to realize a flow into gate movements, we develop efficient techniques which solve an approximated Subset-sum problem. Over the iterations, we factor into our formulation the history which captures a set of likely-to-fail gate movements. Such a history-based scheme enables our algorithm to intelligently legalize highly complex designs. Experimental results on over 740 real cases show that our approach is significantly superior to the existing algorithms in terms of failure rate (no failure) as well as quality of results (55% less max-deviation).
- A. Agnihotri, M. C. Yildiz, A. Khatkhate, A. Mathur, S. Ono, and P. H. Madden. Fractional cut: Improved recursive bisection placement. In Proc. Int. Conf. on Computer Aided Design, 2003. Google Scholar
Digital Library
- U. Brenner, A. Pauli, and J. Vygen. Almost optimum placement legalization by minimum cost flow and dynamic programming. In Proc. Int. Symp. on Physical Design, 2004. Google ScholarDigital Library
- U. Brenner and J. Vygen. Faster optimal single-row placement with fixed ordering. In Proc. Design, Automation and Test in Eurpoe, 2000. Google ScholarDigital Library
- U. Brenner and J. Vygen. Legalizing a placement with minimum total movement. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 23(12):1597--1613, Dec 2004. Google ScholarDigital Library
- T.-C. Chen, Z.-W. Jiang, T.-C. Hsu, H.-C. Chen, and Y.-W. Chang. NTUplace3: An Analytical Placer for Large-Scale Mixed-Size Designs With Preplaced Blocks and Density Constraints. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 27(7):1228--1240, Jul 2008. Google ScholarDigital Library
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. Google ScholarDigital Library
- M. R. Garey, R. E. Tarjan, and G. T. Wilfong. One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res., 13(2), 1988. Google ScholarDigital Library
- A. V. Goldberg. An Effcient Implementation of a Scaling Minimum-Cost Flow Algorithmn. Journal of Algorithms, 22:1--29, 1997. Google ScholarDigital Library
- D. Hill. Method and system for high speed detailed placement of cells within an integrated circuit design". In U.S. Patent 6370673, Apr 2002.Google Scholar
- S. W. Hur and J. Lillis. Mongrel: hybrid techniques for standard cell placement. In Proc. Int. Conf. on Computer Aided Design, 2000. Google ScholarDigital Library
- A. Kahng, P. Tucker, and A. Zelikovsky. Optimization of linear placements for wirelength minimization with free sites. In Proc. Asia and South Pacific Design Automation Conf., 1999.Google ScholarCross Ref
- T. Luo, H. Ren, C. J. Alpert, and D. Z. Pan. Computational geometry based placement migration. In Proc. Int. Conf. on Computer Aided Design, 2005. Google ScholarDigital Library
- D. Pisinger. Linear time algorithms for knapsack problems with bounded weights. Journal of Algorithms, 33:1--14, 1999. Google ScholarDigital Library
- H. Ren, D. Z. Pan, C. J. Alpert, and P. Villarrubia. Diffusion-based placement migration. In Proc. Design Automation Conf., 2005. Google ScholarDigital Library
- T. Taghavi, X. Yang, B.-K. Choi, M. Wang, and M. Sarrafzadeh. Dragon2006: blockage-aware congestion-controlling mixed-size placer. In Proc. Int. Symp. on Physical Design. Google ScholarDigital Library
- N. Viswanathan, M. Pan, and C. Chu. Fastplace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In Proc. Asia and South Pacific Design Automation Conf., 2007. Google ScholarDigital Library
Index Terms
- History-based VLSI legalization using network flow
Recommendations
Eh?Legalizer: A High Performance Standard-Cell Legalizer Observing Technology Constraints
Special Section on Advances in Physical Design Automation and Regular PapersThe legalization step is performed after global placement where wire length and routability are optimized or during timing optimization where buffer insertion or gate sizing are applied to meet timing requirements. Therefore, an ideal legalization ...
A Fast, Robust Network Flow-based Standard-Cell Legalization Method for Minimizing Maximum Movement
ISPD '17: Proceedings of the 2017 ACM on International Symposium on Physical DesignThe standard-cell placement legalization problem has become critical due to increasing design rule complexity and design utilization at 16nm and lower technology nodes. An ideal legalization approach should preserve the quality of the input placement in ...
Mixed-Cell-Height Standard Cell Placement Legalization
GLSVLSI '17: Proceedings of the on Great Lakes Symposium on VLSI 2017A traditional standard cell library consists of various functional cells with the same height, which could speed up VLSI design flow since designers could align cells to placement sites in rows. However, in advanced nodes, cells are designed with ...
Comments