A Statistical Static Timing Analysis Algorithm Based On Graph Neural Network
Satistical static timing analysis (SSTA) struggles with nonlinear MAX operations, which is crucial in block based statistical timing analysis. Most existing methods either incur high computational costs or rely on inaccurate approximations. In this work, we propose a SSTA algorithm based on graph neural network (GNN) to deal with non-Gaussian while balancing speed by using its node regression function. GNN eliminate the traversal propagation through message passing mechanisms and can simulate the nonlinear behavior of MAX operation through its attention mechanisms. Experimental results demonstrate that our model outperforms the First-order delay model and Skew-normal delay model in terms of accuracy, especially when skewness has a significant impact, while its time overhead is on the same order of magnitude as First-order model. Taking into account both accuracy and runtime, our proposed model has significant computational efficiency advantages while ensuring high prediction accuracy.
Authors
- Leyun Tian
- Hao Yan (ORCID: https://orcid.org/0000-0002-5312-4483)
- Yuyang Ye (ORCID: https://orcid.org/0000-0002-0726-0468)
- Yufan Chen (ORCID: https://orcid.org/0009-0006-5317-8867)
- C.Z. Shi
Institutions
- Southeast University (CN)
Publication Details
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1109/iseda65950.2025.11100536
- Citations
- 1
- Primary Topic
- Software System Performance and Reliability
- Type
- article
- Field-Weighted Citation Impact
- 1.49
Funders
- National Natural Science Foundation of China
- Natural Science Foundation of Jiangsu Province
- Fundamental Research Funds for the Central Universities
- Research and Development