摘要(英) |
With the advancement of semiconductor manufacturing techniques, more transistors can be accommodated in the same area. As the results, the complexity of Integrated Circuits (ICs) increases. Consequently, designing ICs has become notably time consuming. Among the various stages, routing, in particular, is one of the most time-consuming steps in the physical design process, often taking several hours or even days. In some cases, issues such as routing congestion or Design Rule Violations (DRVs) occur. When these issues arise, it necessitates returning to earlier stages of the process to adjust the chip design to fix these issues. This iterative process may occur multiple times throughout the chip design cycle. Hence, many studies employ machine learning algorithms to construct models that can predict potential issues in previous stages. Engineers can adjust chip design before actually performing routing, reducing the repeated execution of the routing process. However, due to the process of chip design is time consuming, it’s hard to collect a vast amount of training data. Moreover, Neural Network (NN) base model needs a lot of data for model training, insufficient training data might lead to overfitting. Therefore, this paper utilizes the ensemble learning algorithm, Extreme Gradient Boosting (XGBoost). XGBoost is a highly efficient algorithm, and compared to traditional gradient boosting methods, XGBoost incorporates regularization term into its objective function. This regularization term can prevent overfitting, enabling the model to predict routing outcomes accurately with limited training data. Additionally, XGBoost is based on a decision tree structure, offering better interpretability compared to neural networks. Leveraging these advantages of XGBoost, this paper analyzes the importance of input features, filtering out redundant features to reduce training time and boost model efficiency during inference. During model training, we extract circuit features in placement stage and use the routing demand after global routing as the prediction target. |
參考文獻 |
[1]. Tianqi Chen and Carlos Guestrin. Xgboost: A scalable tree boosting system. In Proceedings of the 22Nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’16, pages 785–794, New York, NY, USA, 2016. ACM.
[2]. A. F. Tabrizi et al., "A Machine Learning Framework to Identify Detailed Routing Short Violations from a Placed Netlist," 2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC), San Francisco, CA, USA, 2018, pp. 1-6
[3]. Z. Xie et al., "RouteNet: Routability prediction for Mixed-Size Designs Using Convolutional Neural Network," 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), San Diego, CA, USA, 2018
[4]. Z. Zhou et al., "Congestion-aware Global Routing using Deep Convolutional Generative Adversarial Networks," 2019 ACM/IEEE 1st Workshop on Machine Learning for CAD (MLCAD), Canmore, AB, Canada, 2019, pp. 1-6
[5]. Y. -H. Huang et al., "Routability-Driven Macro Placement with Embedded CNN-Based Prediction Model," 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), Florence, Italy, 2019, pp. 180-185
[6]. W. Zeng, A. Davoodi and R. O. Topaloglu, "Explainable DRC Hotspot Prediction with Random Forest and SHAP Tree Explainer," 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE), Grenoble, France, 2020, pp. 1151-1156
[7]. C. Ma, Y. Xiao, S. Wang, J. Yu and J. Chen, "CongestNN: An Bi-Directional Congestion Prediction Framework for Large-Scale Heterogeneous FPGAs," 2021 IEEE 14th International Conference on ASIC (ASICON), Kunming, China, 2021, pp. 1-4
[8]. D. Kim, H. Kwon, S. -Y. Lee, S. Kim, M. Woo and S. Kang, "Machine Learning Framework for Early Routability Prediction with Artificial Netlist Generator," 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE), Grenoble, France, 2021, pp. 1809-1814
[9]. S. Liu, Q. Sun, P. Liao, Y. Lin and B. Yu, "Global Placement with Deep Learning-Enabled Explicit Routability Optimization," 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE), Grenoble, France, 2021, pp. 1821-1824
[10]. Y. -Y. Huang, C. -T. Lin, W. -L. Liang and H. -M. Chen, "Learning Based Placement Refinement to Reduce DRC Short Violations," 2021 International Symposium on VLSI Design, Automation and Test (VLSI-DAT), Hsinchu, Taiwan, 2021, pp. 1-4
[11]. M. Su et al., "High-Correlation 3D Routability Estimation for Congestion-guided Global Routing," 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC), Taipei, Taiwan, 2022, pp. 580-585
[12]. J.G. Lin et al, "DRC Violation Prediction with Pre-global-routing Features Through Convolutional Neural Network," in GLSVLSI ′23: Proceedings of the Great Lakes Symposium on VLSI, pages 313–319, Knoxville TN USA, 2023
[13]. M. Rapp et al., "MLCAD: A Survey of Research in Machine Learning for CAD Keynote Paper," in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 41, no. 10, pp. 3162-3181
[14]. Cadence, Inc. Innovus Implementation System.https://www.cadence.com/en_US/home/tools/digital-design-andsignoff/soc-implementation-and-floorplanning/innovus-implementationsystem.html
[15]. “dmlc XGBoost stable”, https://xgboost.readthedocs.io/en/stable/index.html |