Abstract
The 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 approach must preserve the quality of the input placement in terms of routability, wire length, and timing constraints. These requirements indirectly impose maximum and average cell movement constraints during legalization. In addition, the legalization step should effectively manage white space availability with a highly efficient runtime in order to be used in an iterative process such as timing optimization. In this article, a robust and fast legalization method called Eh?Legalizer for standard-cell placement is presented. Eh?Legalizer legalizes input placements while minimizing the maximum and average cell movements using a highly efficient novel network flow-based approach. In contrast to the traditional network flow-based legalizers, areas with high cell utilizations are effectively legalized by finding several candidate paths and there is no need for a post-process step. The experimental results conducted on several benchmarks show that Eh?Legalizer results in 2.5 times and 3.3 times less the maximum and average cell movement, respectively, while its runtime is significantly (18×) lower compared to traditional legalizers. In addition, the experimental results illustrate the scalability and robustness of Eh?Legalizer with respect to the floorplan complexity. Finally, the detailed-routing results show detailed-routing violations are reduced on average by 23% when Eh?Legalizer is used to generate legal solutions.
- R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River, NJ. Google ScholarDigital Library
- U. Brenner. 2013. BonnPlace legalization: Minimizing movement by iterative augmentation. IEEE TCAD 32, 8 (Aug. 2013), 1215--1227. Google ScholarDigital Library
- Ismail S. Bustany, David Chinnery, Joseph R. Shinnerl, and Vladimir Yutsi. 2015. ISPD 2015 benchmarks with fence regions and routing blockages for detailed-routing-driven placement. In Proc. of ISPD. 157--164. Google ScholarDigital Library
- Cadence, Inc. 2009. LEF/DEF version 5.3-5.7 exchange format. Retrieved Jan. 1, 2015 from http://www.si2.org/openeda.si2.org/projects/lefdef.Google Scholar
- Minsik Cho, Haoxing Ren, Hua Xiang, and Ruchir Puri. 2010. History-based VLSI legalization using network flow. In Proc. of DAC. 286--291. Google ScholarDigital Library
- W.-K. Chow, J. Kuang, X. He, W. Cai, and Evangeline F. Y. Young. 2014. Cell density-driven detailed placement with displacement constraint. In Proc. of ISPD. 3--10. Google ScholarDigital Library
- Nima Karimpour Darav, Andrew Kennings, David Westwick, and Laleh Behjat. 2015. High performance global placement and legalization accounting for fence regions. In Proc. of ICCAD. 514--519. Google ScholarDigital Library
- E. W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 1 (Dec. 1959), 269--271. Google ScholarDigital Library
- D. Hill. 2002. Method and system for high speed detailed placement of cells within an integrated circuit design. (March 22, 1999). US Patent 6,370,673 (April 9, 2002).Google Scholar
- Chau-Chin Huang, Hsin-Ying Lee, Bo-Qiao Lin, Sheng-Wei Yang, Chin-Hao Chang, Szu-To Chen, and Yao-Wen Chang. 2015. Detailed-routability-driven analytical placement for mixed-size designs with technology and region constraints. In Proc. of ICCAD. Piscataway, NJ, 508--513. Google ScholarDigital Library
- Andrew B. Kahng, Igor L. Markov, and Sherief Reda. 2004. On legalization of row-based placements. In Proc. of GLSVLSI. 214--219. Google ScholarDigital Library
- N. Karimpour Darav, A. Kennings, A. Fakheri Tabrizi, D. Westwick, and L. Behjat. 2016. Eh?placer: A high-performance modern technology-driven placer. ACM TODAES 21, 3 (April 2016), Article 37, 27 pages. Google ScholarDigital Library
- Andrew Kennings, Nima Karimpour Darav, and Laleh Behjat. 2014. Detailed placement accounting for technology constraints. In Proc. of VLSI-SoC. 1--6.Google ScholarCross Ref
- Myung-Chul Kim, Dongjin Lee, and Igor L. Markov. 2012. SimPL: An effective placement algorithm. IEEE TCAD 31, 1 (2012), 50--60. Google ScholarDigital Library
- M. C. Kim, N. Viswanathan, Z. Li, and C. Alpert. 2013. ICCAD-2013 CAD contest in placement finishing and benchmark suite. In Proc. of ICCAD. 268--270. Google ScholarDigital Library
- Tao Lin, Chris Chu, Joseph R. Shinnerl, Ismail Bustany, and Ivailo Nedelchev. 2015. POLAR: A high performance mixed-size wirelengh-driven placer with density constraints. IEEE TCAD 34, 3 (2015), 447--459.Google Scholar
- Mentor Graphics, Inc. 2015. Olympus-SoC Place and Route for Advanced Node Designs. Technical Report. www.mentor.com/products/ic_nanometer_design/place-route/olympus-soc.Google Scholar
- Gi-Joon Nam. 2006. ISPD 2006 placement contest: Benchmark suite and results. In Proc. of ISPD. 167--167. Google ScholarDigital Library
- H. Ren, D. Z. Pan, C. J. Alpert, and P. Villarrubia. 2005. Diffusion-based placement migration. In Proc. of DAC. 515--520. Google ScholarDigital Library
- S. S. Skiena. 2008. The Algorithm Design Manual (2nd ed.). Springer Publishing Company, Incorporated. Google ScholarDigital Library
- Peter Spindler, Ulf Schlichtmann, and Frank M. Johannes. 2008. Abacus: Fast legalization of standard cell circuits with minimal movement. In Proc. of ISPD. 47--53. Google ScholarDigital Library
- N. Viswanathan, Min Pan, and C. Chu. 2007. FastPlace 3.0: A fast multilevel quadratic placement algorithm with placement congestion control. In Proc. of ASP-DAC. Washington, DC, 135--140. Google ScholarDigital Library
- Chun-Kai Wang, Chuan-Chia Huang, Sean Shih-Ying Liu, Ching-Yu Chin, Sheng-Te Hu, Wei-Chen Wu, and Hung-Ming Chen. 2015. Closing the gap between global and detailed placement: Techniques for improving routability. In Proc. of ISPD. 149--156. Google ScholarDigital Library
- Vladimir Yutsis, Ismail S. Bustany, David Chinnery, Joseph R. Shinnerl, and Wen-Hao Liu. 2014. ISPD 2014 benchmarks with sub-45Nm technology rules for detailed-routing-driven placement. In Proc. of ISPD. 161--168. Google ScholarDigital Library
Index Terms
- Eh?Legalizer: A High Performance Standard-Cell Legalizer Observing Technology Constraints
Recommendations
ISPD 2015 Benchmarks with Fence Regions and Routing Blockages for Detailed-Routing-Driven Placement
ISPD '15: Proceedings of the 2015 Symposium on International Symposium on Physical DesignThe ISPD~2015 placement-contest benchmarks include all the detailed pin, cell, and wire geometry constraints from the 2014 release, plus
(a) added fence regions and placement blockages,
(b) altered netlists including fixed macro blocks,
(c) reduced ...
Eh?Placer: A High-Performance Modern Technology-Driven Placer
Special Section on New Physical Design Techniques for the Next Generation Integration Technology and Regular PapersThe placement problem has become more complex and challenging due to a wide variety of complicated constraints imposed by modern process technologies. Some of the most challenging constraints and objectives were highlighted during the most recent ACM/...
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 ...
Comments