SyncTREE: Fast Timing Analysis for Integrated Circuit Design through a Physics-informed Tree-based Graph Neural Network
Yuting Hu, Jiajie Li, Florian Klemme, Gi-Joon Nam, Tengfei Ma, Hussam Amrouch, Jinjun Xiong
Abstract
Nowadays integrated circuits (ICs) are underpinning all major information technology innovations including the current trends of artificial intelligence (AI). Modern IC designs often involve analyses of complex phenomena (such as timing, noise, and power etc.) for tens of billions of electronic components, like resistance (R), capacitance (C), transistors and gates, interconnected in various complex structures. Those analyses often need to strike a balance between accuracy and speed as those analyses need to be carried out many times throughout the entire IC design cycles. With the advancement of AI, researchers also start to explore news ways in leveraging AI to improve those analyses. This paper focuses on one of the most important analyses, timing analysis for interconnects. Since IC interconnects can be represented as an RC-tree, a specialized graph as tree, we design a novel tree-based graph neural network, SyncTREE, to speed up the timing analysis by incorporating both the structural and physical properties of electronic circuits. Our major innovations include (1) a two-pass message-passing (bottom-up and top-down) for graph embedding, (2) a tree contrastive loss to guide learning, and (3) a closed formular-based approach to conduct fast timing. Our experiments show that, compared to conventional GNN models, SyncTREE achieves the best timing prediction in terms of both delays and slews, all in reference to the industry golden numerical analyses results on real IC design data.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on12
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- DeepGCNs: Can GCNs Go As Deep As CNNs?Guohao Li, Matthias Müller, Ali K. Thabet, Bernard GhanemICCV 2019 · 1,586 citations
- Adversarial Graph Augmentation to Improve Graph Contrastive LearningSusheel Suresh, Pan Li, Cong Hao, Jennifer NevilleNeurIPS 2021 · 475 citations
- Representing Long-Range Context for Graph Neural Networks with Global AttentionZhanghao Wu, Paras Jain, Matthew A. Wright, Azalia Mirhoseini et al.NeurIPS 2021 · 450 citations
- A timing engine inspired graph neural network model for pre-routing slack predictionZizheng Guo, Mingjie Liu, Jiaqi Gu, Shuhan Zhang et al.DAC 2022 · 121 citations
Related papers
- Versatile Multi-stage Graph Neural Network for Circuit RepresentationShuwen Yang, Zhihao Yang, Dong Li, Yingxue Zhang et al.NeurIPS 2022 · 72 citations
- CirSTAG: Circuit Stability Analysis on Graph-based ManifoldsWuxinlin Cheng, Yihang Yuan, Chenhui Deng, Ali Aghdaei et al.DAC 2025 · 1 citation
- High-level synthesis performance prediction using GNNs: benchmarking, modeling, and advancingNan Wu, Hang Yang, Yuan Xie, Pan Li et al.DAC 2022 · 57 citations
- Fast and Accurate Wire Timing Estimation on Tree and Non-Tree Net StructuresHsien-Han Cheng, Iris Hui-Ru Jiang, Oscar OuDAC 2020 · 35 citations
- Functionality matters in netlist representation learningZiyi Wang, Chen Bai, Zhuolun He, Guangliang Zhang et al.DAC 2022 · 45 citations
