CirSTAG: Circuit Stability Analysis on Graph-based Manifolds
Wuxinlin Cheng, Yihang Yuan, Chenhui Deng, Ali Aghdaei, Zhiru Zhang, Zhuo Feng
Abstract
Circuit stability (sensitivity) analysis aims to estimate the overall performance impact of variations in underlying design parameters, such as gate sizes and capacitance. This process is challenging because it often requires numerous time-consuming circuit simulations. In contrast, graph neural networks (GNNs) have shown remarkable effectiveness and efficiency in tackling several chip design automation issues, including circuit timing predictions, parasitic prediction, gate sizing, and device placement. This paper introduces a novel approach called CirSTAG, which utilizes GNNs to analyze the stability (robustness) of modern integrated circuits (ICs). CirSTAG is grounded in a spectral framework that examines the stability of GNNs by leveraging input/output graph-based manifolds. When two adjacent nodes on the input manifold are mapped (through a GNN model) to two remote nodes (data samples) on the output manifold, this indicates a significant mapping distortion (DMD) and consequently poor GNN stability. CirSTAG calculates a stability score equivalent to the local Lipschitz constant for each node and edge, considering both graph structure and node feature perturbations. This enables the identification of the most critical (sensitive) circuit elements that could significantly impact circuit performance. Our empirical evaluations across various timing prediction tasks with realistic circuit designs demonstrate that CirSTAG can accurately estimate the stability of each circuit element under diverse parameter variations. This offers a scalable method for assessing the stability of large integrated circuit designs.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext fd283ef7-9849-4455-9cef-a83f83349a60Builds on5
- 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
- RL-Sizer: VLSI Gate Sizing for Timing Optimization using Deep Reinforcement LearningYi-Chen Lu, Siddhartha Nath, Vishal Khandelwal, Sung Kyu LimDAC 2021 · 66 citations
- Gamora: Graph Learning based Symbolic Reasoning for Large-Scale Boolean NetworksNan Wu, Yingjie Li, Cong Hao, Steve Dai et al.DAC 2023 · 35 citations
- SPADE: A Spectral Method for Black-Box Adversarial Robustness EvaluationWuxinlin Cheng, Chenhui Deng, Zhiqiang Zhao, Yaohui Cai et al.ICML 2021 · 24 citations
- SGL: Spectral Graph Learning from MeasurementsZhuo FengDAC 2021 · 3 citations
Related papers
- Timing macro modeling with graph neural networksKevin Kai-Chun Chang, Chun-Yao Chiang, Pei-Yu Lee, Iris Hui-Ru JiangDAC 2022 · 6 citations
- SyncTREE: Fast Timing Analysis for Integrated Circuit Design through a Physics-informed Tree-based Graph Neural NetworkYuting Hu, Jiajie Li, Florian Klemme, Gi-Joon Nam et al.NeurIPS 2023 · 12 citations
- ParaGraph: Layout Parasitics and Device Parameter Prediction using Graph Neural NetworksHaoxing Ren, George F. Kokai, Walker J. Turner, Ting-Sheng KuDAC 2020 · 107 citations
- High-level synthesis performance prediction using GNNs: benchmarking, modeling, and advancingNan Wu, Hang Yang, Yuan Xie, Pan Li et al.DAC 2022 · 57 citations
- Versatile Multi-stage Graph Neural Network for Circuit RepresentationShuwen Yang, Zhihao Yang, Dong Li, Yingxue Zhang et al.NeurIPS 2022 · 72 citations
