mlsanityData to 7 Oct 2026

GNN4REL: Graph Neural Networks for Predicting Circuit Reliability Degradation

arXiv 2208.02868 ↗First posted 4 Aug 2022cs.LG cs.CRcited by 4

Not on the map. Why?

Abstract (arXiv)

Process variations and device aging impose profound challenges for circuit designers. Without a precise understanding of the impact of variations on the delay of circuit paths, guardbands, which keep timing violations at bay, cannot be correctly estimated. This problem is exacerbated for advanced technology nodes, where transistor dimensions reach atomic levels and established margins are severely constrained. Hence, traditional worst-case analysis becomes impractical, resulting in intolerable performance overheads. Contrarily, process-variation/aging-aware static timing analysis (STA) equips designers with accurate statistical delay distributions. Timing guardbands that are small, yet sufficient, can then be effectively estimated. However, such analysis is costly as it requires intensive Monte-Carlo simulations. Further, it necessitates access to confidential physics-based aging models to generate the standard-cell libraries required for STA. In this work, we employ graph neural networks (GNNs) to accurately estimate the impact of process variations and device aging on the delay of any path within a circuit. Our proposed GNN4REL framework empowers designers to perform rapid and accurate reliability estimations without accessing transistor models, standard-cell libraries, or even STA; these components are all incorporated into the GNN model via training by the foundry. Specifically, GNN4REL is trained on a FinFET technology model that is calibrated against industrial 14nm measurement data. Through our extensive experiments on EPFL and ITC-99 benchmarks, as well as RISC-V processors, we successfully estimate delay degradations of all paths -- notably within seconds -- with a mean absolute error down to 0.01 percentage points.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 9 of its 38 references that are in the map. First posted on arXiv 4 Aug 2022.

Builds on

9 of 38 references.

References · 9

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2018How Powerful are Graph Neural Networks?cited by 4,355
  3. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  4. 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
  5. 2019Neural Execution of Graph Algorithmscited by 118
  6. 2020GNNUnlock: Graph Neural Networks-based Oracle-less Unlocking Scheme for Provably Secure Logic Lockingcited by 5
  7. 2021MuxLink: Circumventing Learning-Resilient MUX-Locking Using Graph Neural Network-based Link Predictioncited by 5
  8. 2021UNTANGLE: Unlocking Routing and Logic Obfuscation Using Graph Neural Networks-based Link Predictioncited by 2
  9. 2017On Timing Model Extraction and Hierarchical Statistical Timing Analysiscited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 2; 2025: 1.

4 papers.