mlsanityData to 7 Oct 2026

PreRoutGNN for Timing Prediction with Order Preserving Partition: Global Circuit Pre-training, Local Delay Learning and Attentional Cell Modeling

arXiv 2403.00012 ↗First posted 27 Feb 2024cs.LG cs.ARcited by 5

Not on the map. Why?

Abstract (arXiv)

Pre-routing timing prediction has been recently studied for evaluating the quality of a candidate cell placement in chip design. It involves directly estimating the timing metrics for both pin-level (slack, slew) and edge-level (net delay, cell delay), without time-consuming routing. However, it often suffers from signal decay and error accumulation due to the long timing paths in large-scale industrial circuits. To address these challenges, we propose a two-stage approach. First, we propose global circuit training to pre-train a graph auto-encoder that learns the global graph embedding from circuit netlist. Second, we use a novel node updating scheme for message passing on GCN, following the topological sorting sequence of the learned graph embedding and circuit graph. This scheme residually models the local time delay between two adjacent pins in the updating sequence, and extracts the lookup table information inside each cell via a new attention mechanism. To handle large-scale circuits efficiently, we introduce an order preserving partition scheme that reduces memory consumption while maintaining the topological dependencies. Experiments on 21 real world circuits achieve a new SOTA R2 of 0.93 for slack prediction, which is significantly surpasses 0.59 by previous SOTA method. Code will be available at: https://github.com/Thinklab-SJTU/EDA-AI.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 23 of its 48 references that are in the map. First posted on arXiv 27 Feb 2024.

Builds on

23 of 48 references.

References · 23

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  4. 2020Language Models are Few-Shot Learnerscited by 32,199
  5. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  6. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  7. 2017Graph Attention Networkscited by 8,854
  8. 2018How Powerful are Graph Neural Networks?cited by 4,355
  9. 2021BEiT: BERT Pre-Training of Image Transformerscited by 2,360
  10. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  11. 2019Strategies for Pre-training Graph Neural Networkscited by 964
  12. 2020Simple and Deep Graph Convolutional Networkscited by 857
11 more
  1. 2022Anti-Oversmoothing in Deep Vision Transformers via the Fourier Domain Analysis: From Theory to Practicecited by 136
  2. 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 131
  3. 2023DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusioncited by 85
  4. 2021On Joint Learning for Solving Placement and Routing in Chip Designcited by 44
  5. 2022MaskPlace: Fast Chip Placement via Reinforced Visual Representation Learningcited by 43
  6. 2023ChiPFormer: Transferable Chip Placement via Offline Decision Transformercited by 42
  7. 2021DeepGate: Learning Neural Representations of Logic Gatescited by 37
  8. 2022LHNN: Lattice Hypergraph Neural Network for VLSI Congestion Predictioncited by 18
  9. 2021Generalizable Cross-Graph Embedding for GNN-based Congestion Predictioncited by 17
  10. 2020Net2: A Graph Attention Network Method Customized for Pre-Placement Net Length Estimationcited by 8
  11. 2022Too Big to Fail? Active Few-Shot Learning Guided Logic Synthesiscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 3; 2026: 1.

5 papers.