Enhancing cell delay accuracy in post-placed netlists using ensemble tree-based algorithms

被引:0
|
作者
Attaoui, Yassine [1 ]
Chentouf, Mohamed [1 ]
Ismaili, Zine El Abidine Alaoui [2 ]
El Mourabit, Aimad [3 ]
机构
[1] Siemens EDA CSD Calypto Synth Solut, Rabat, Morocco
[2] Mohammed V Univ, Informat Commun & Embedded Syst ICES Team, Rabat, Morocco
[3] Abdelmalek Essaadi Univ, Syst & Data Engn Team, ENSA Tangier, Tangier, Morocco
关键词
Delay estimation; Machine learning; Tree-based algorithms; Post-placement delay estimation; Cell delay;
D O I
10.1016/j.vlsi.2024.102193
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Nowadays, the ASIC design is increasing in complexity, and PPA targets are pushed to the limit. The lack of physical information at the early design stages hinders precise timing predictions and may lead to design re -spins. In previous work, we successfully improved timing prediction at the post -placement stage using the Random Forest model, achieving 91.25% cell delay accuracy. Building upon this, we further investigate the potential of Ensemble Tree-based algorithms, specifically focusing on " Extremely Randomized Trees "and " Gradient Boosting ", to close the gap in cell delay accuracy. In this paper, we enrich the training dataset with new 16 nm industrial designs. The results demonstrate a substantial improvement, with an average cell delay accuracy of 92.01% and 84.26% on unseen data. The average Root-Mean-Square-Error is significantly reduced from 12.11 to 3.23 and 7.76 on unseen data.
引用
收藏
页数:10
相关论文
共 50 条
  • [31] Earthquake prediction from seismic indicators using tree-based ensemble learning
    Zhao, Yang
    Gorse, Denise
    NATURAL HAZARDS, 2024, 120 (03) : 2283 - 2309
  • [32] Nowcasting US GDP Using Tree-Based Ensemble Models and Dynamic Factors
    Soybilgen, Baris
    Yazgan, Ege
    COMPUTATIONAL ECONOMICS, 2021, 57 (01) : 387 - 417
  • [33] An investigation of feature selection methods for soil liquefaction prediction based on tree-based ensemble algorithms using AdaBoost, gradient boosting, and XGBoost
    Selçuk Demir
    Emrehan Kutlug Sahin
    Neural Computing and Applications, 2023, 35 : 3173 - 3190
  • [34] An investigation of feature selection methods for soil liquefaction prediction based on tree-based ensemble algorithms using AdaBoost, gradient boosting, and XGBoost
    Demir, Selcuk
    Sahin, Emrehan Kutlug
    NEURAL COMPUTING & APPLICATIONS, 2023, 35 (04): : 3173 - 3190
  • [35] Nowcasting US GDP Using Tree-Based Ensemble Models and Dynamic Factors
    Barış Soybilgen
    Ege Yazgan
    Computational Economics, 2021, 57 : 387 - 417
  • [36] Malware Classification of Portable Executables using Tree-Based Ensemble Machine Learning
    Atluri, Venkata
    2019 IEEE SOUTHEASTCON, 2019,
  • [37] Fluvial bedload transport modelling: advanced ensemble tree-based models or optimized deep learning algorithms?
    Khosravi, Khabat
    Farooque, Aitazaz A.
    Bateni, Sayed M.
    Jun, Changhyun
    Mohammadi, Dorsa
    Kalantari, Zahra
    Cooper, James R.
    ENGINEERING APPLICATIONS OF COMPUTATIONAL FLUID MECHANICS, 2024, 18 (01)
  • [38] EVALUATION OF TREE-BASED ENSEMBLE LEARNING ALGORITHMS TO ESTIMATE TOTAL ORGANIC CARBON FROM WIRELINE LOGS
    Rahaman, Md Shokor A.
    Vasant, Pandian
    Ul Haq, Izhar
    Padmanabhan, Eswaran
    Jufar, Shiferaw Regassa
    Sokkalingam, Rajalingam
    Watada, Junzo
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2021, 17 (03): : 807 - 829
  • [39] Comparing Predicted Historical Distributions of Tree Species Using Two Tree-based Ensemble Classification Methods
    Hanberry, Brice B.
    He, Hong S.
    Palik, Brian J.
    AMERICAN MIDLAND NATURALIST, 2012, 168 (02): : 443 - 455
  • [40] Assessment of explainable tree-based ensemble algorithms for the enhancement of Copernicus digital elevation model in agricultural lands
    Okolie, Chukwuma
    Adeleke, Adedayo
    Mills, Jon
    Smit, Julian
    Maduako, Ikechukwu
    Bagheri, Hossein
    Komar, Tom
    Wang, Shidong
    INTERNATIONAL JOURNAL OF IMAGE AND DATA FUSION, 2024, 15 (04) : 430 - 460