Yibo Lin
ABSTRACT
Placement for very-large-scale integrated (VLSI) circuits is one of the most important steps for design closure. This paper proposes a novel GPU-accelerated placement framework DREAMPlace, by casting the analytical placement problem equivalently to training a neural network. Implemented on top of a widely-adopted deep learning toolkit PyTorch, with customized key kernels for wirelength and density computations, DREAMPlace can achieve over 30× speedup in global placement without quality degradation compared to the state-of-the-art multi-threaded placer RePlAce. We believe this work shall open up new directions for revisiting classical EDA problems with advancement in AI hardware and software.
- T. Chan, J. Cong, and K. Sze, "Multilevel generalized force-directed method for circuit placement," in Proc. ISPD. ACM, 2005, pp. 185--192. Google Scholar
Digital 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 TCAD, vol. 27, no. 7, pp. 1228--1240, 2008. Google ScholarDigital Library
- M.-K. Hsu, Y.-F. Chen, C.-C. Huang, S. Chou, T.-H. Lin, T.-C. Chen, and Y.-W. Chang, "NTUplace4h: A novel routability-driven placement algorithm for hierarchical mixed-size circuit designs," IEEE TCAD, vol. 33, no. 12, pp. 1914--1927, 2014.Google ScholarCross Ref
- J. Lu, P. Chen, C.-C. Chang, L. Sha, D. J.-H. Huang, C.-C. Teng, and C.-K. Cheng, "ePlace: Electrostatics-based placement using fast fourier transform and nesterov's method," ACM TODAES, vol. 20, no. 2, p. 17, 2015. Google ScholarDigital Library
- J. Lu, H. Zhuang, P. Chen, H. Chang, C.-C. Chang, Y.-C. Wong, L. Sha, D. Huang, Y. Luo, C.-C. Teng et al., "ePlace-MS: Electrostatics-based placement for mixed-size circuits," IEEE TCAD, vol. 34, no. 5, pp. 685--698, 2015.Google Scholar
- C.-K. Cheng, A. B. Kahng, I. Kang, and L. Wang, "Replace: Advancing solution quality and routability validation in global placement," IEEE TCAD, 2018.Google Scholar
- Z. Zhu, J. Chen, Z. Peng, W. Zhu, and Y.-W. Chang, "Generalized augmented lagrangian and its applications to vlsi global placement," in Proc. DAC. IEEE, 2018, pp. 1--6. Google ScholarDigital Library
- M.-C. Kim, D.-J. Lee, and I. L. Markov, "SimPL: An effective placement algorithm," IEEE TCAD, vol. 31, no. 1, pp. 50--60, 2012. Google ScholarDigital Library
- X. He, T. Huang, L. Xiao, H. Tian, and E. F. Y. Young, "Ripple: A robust and effective routability-driven placer," IEEE TCAD, vol. 32, no. 10, pp. 1546--1556, 2013. Google ScholarDigital Library
- T. Lin, C. Chu, J. R. Shinnerl, I. Bustany, and I. Nedelchev, "POLAR: A high performance mixed-size wirelengh-driven placer with density constraints," IEEE TCAD, vol. 34, no. 3, pp. 447--459, 2015.Google Scholar
- T. Lin, C. Chu, and G. Wu, "Polar 3.0: An ultrafast global placement engine," in Proc. ICCAD. IEEE, 2015, pp. 520--527. Google ScholarDigital Library
- A. Ludwin, V. Betz, and K. Padalia, "High-quality, deterministic parallel placement for fpgas on commodity hardware," in Proc. FPGA. ACM, 2008, pp. 14--23. Google ScholarDigital Library
- W. Li, M. Li, J. Wang, and D. Z. Pan, "UTPlaceF 3.0: A parallelization framework for modern FPGA global placement," in Proc. ICCAD. IEEE, 2017, pp. 922--928. Google ScholarDigital Library
- J. Cong and Y. Zou, "Parallel multi-level analytical global placement on graphics processing units," in Proc. ICCAD. ACM, 2009, pp. 681--688. Google ScholarDigital Library
- C.-X. Lin and M. D. Wong, "Accelerate analytical placement with gpu: A generic approach," in Proc. DATE. IEEE, 2018, pp. 1345--1350.Google Scholar
- A. B. Kahng, S. Reda, and Q. Wang, "Architecture and details of a high quality, large-scale analytical placer," in Proc. ICCAD. IEEE, 2005, pp. 891--898. Google ScholarDigital Library
- I. Goodfellow, Y. Bengio, A. Courville, and Y. Bengio, Deep learning. MIT press Cambridge, 2016, vol. 1. Google ScholarDigital Library
- A. B. Kahng and Q. Wang, "A faster implementation of APlace," in Proc. ISPD. ACM, 2006, pp. 218--220. Google ScholarDigital Library
- J. Makhoul, "A fast cosine transform in one and two dimensions," IEEE Transactions on Signal Processing, vol. 28, no. 1, pp. 27--34, 1980.Google ScholarCross Ref
- D. Kinga and J. B. Adam, "A method for stochastic optimization," in Proc. ICLR, 2015.Google Scholar
- P. Spindler, U. Schlichtmann, and F. M. Johannes, "Abacus: fast legalization of standard cell circuits with minimal movement," in Proc. ISPD, 2008, pp. 47--53. Google ScholarDigital Library
- G.-J. Nam, C. J. Alpert, P. Villarrubia, B. Winter, and M. Yildiz, "The ispd2005 placement contest and benchmark suite," in Proc. ISPD. ACM, 2005, pp. 216--220. Google ScholarDigital Library
- S. Dhar and D. Z. Pan, "GDP: GPU accelerated detailed placement," in Proc. HPEC, Sept 2018.Google ScholarCross Ref
- T. F. Chan, K. Sze, J. R. Shinnerl, and M. Xie, "Mpl6: Enhanced multilevel mixed-size placement with congestion control," in Modern Circuit Placement. Springer, 2007.Google Scholar
- A. B. Kahng and Q. Wang, "An analytic placer for mixed-size placement and timing-driven placement," in Proc. ICCAD. IEEE, 2004, pp. 565--572. Google ScholarDigital Library
- W. C. Naylor, R. Donelly, and L. Sha, "Non-linear optimization system and method for wire length and delay optimization for an automatic electric circuit placer," Oct. 9 2001, US Patent 6,301,693.Google Scholar
- DREAMPlace: Deep Learning Toolkit-Enabled GPU Acceleration for Modern VLSI Placement
Recommendations
DREAMPlace 3.0: multi-electrostatics based robust VLSI placement with region constraints
ICCAD '20: Proceedings of the 39th International Conference on Computer-Aided DesignPlacement is a critical step for modern very-large-scale integrated (VLSI) design closure. Recently, electrostatics-based analytical placement frameworks (ePlace) demonstrate promising performance in both solution quality and runtime. However, existing ...
DREAMPlace 4.0: timing-driven global placement with momentum-based net weighting
DATE '22: Proceedings of the 2022 Conference & Exhibition on Design, Automation & Test in EuropeTiming optimization is critical to integrated circuit (IC) design closure. Existing global placement algorithms mostly focus on wirelength optimization without considering timing. In this paper, we propose a timing-driven global placement algorithm ...
DREAMPlace 4.0: Timing-Driven Placement With Momentum-Based Net Weighting and Lagrangian-Based Refinement
Optimizing timing is critical to the design closure of integrated circuits (ICs). However, most existing algorithms for circuit placement focus on the optimization of wirelength instead of timing metrics. This article presents a timing-driven placement ...
Comments