- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes ECOpilot, a framework for post-route timing ECO that connects a graph attention encoder over critical-path subgraphs to a frozen Llama 3.1 8B model through a trainable projection. The encoder and projection are pretrained with masked gate modeling (MGM) and arrival-time regression (ATR) on PrimeTime labels. They are then fine-tuned to regress the tool-measured delay change of a candidate cell replacement.
Separately, a CNN trained with contrastive, ranking and regression objectives embeds each standard cell’s NLDM delay table. The embedding is compressed with PCA, concatenated with logical-effort parameters, and stored in a database that is retrieved into the prompt as text.
A four-agent loop applies these components to gate sizing and threshold-voltage swapping. A Netlist Analyzer selects critical instances with a corner-weighted heuristic. A Circuit Optimizer proposes replacements. A Tool-Based Evaluator obtains PrimeTime estimate_eco feedback, and a Script Generator emits Innovus commands.
Experiments use 13 OpenCores designs implemented in TSMC 7 nm, with 8 for training and 5 held out. The paper reports 97.2% MGM accuracy and 8.6% ATR MAPE on held-out designs, and a reduction in cell-delay MAE from 3.57 to 1.36 ps with combined physical and logical cell features. Post-ECO results on three held-out designs at FF, TT and SS corners are compared with a greedy cell-sensitivity heuristic (CS) and with ECO-GNN.
Critical strengths
S1. The evaluation uses designs implemented in a commercial 7 nm flow.
S2. On held-out designs, the model degrades more gracefully on ATR than the Q-Former baseline.
Critical weaknesses
W2. Post-route timing ECO by gate sizing and Vt swapping is a standard capability of the commercial engines already used in this flow, such as PrimeTime fix_eco_timing and Innovus post-route optimization. No comparison with them is provided. The paper therefore does not establish a practical role for the method, for example repairing violations that remain after the tool converges, or reaching equal QoR with fewer cell changes or lower leakage. The near-complete repair achieved by the five-iteration greedy CS baseline, which reduces corner-average TNS by 97.6% to 98.9%, also suggests the evaluated violations are not challenging. Learned sizing methods the paper cites, TransSizer and LEGO-Size, are not compared either.
The related work omits several directly relevant lines of research. For circuit representation learning, CircuitFusion (ICLR 2025), NetTAG (DAC 2025) and GenEDA (2025) already combine netlist graphs with text or LLM latent spaces, use sub-circuit splitting at sequential boundaries and masked graph modeling, and align representations with implementation stages. For timing prediction, TimingPredict (DAC 2022) and PreRoutGNN (AAAI 2024) encode cell lookup tables inside timing GNNs. For learned sizing and ECO, RL-Sizer (DAC 2021) performs post-route timing sizing with multi-corner multi-mode information encoded by GNNs, and RL-LR-Sizer (MLCAD 2024), GNN-based Lagrangian-relaxation imitation (ICCAD 2022) and GNN-based Vth assignment methods address the same action space. For LLM agents, Retrieve-Schedule-Reflect (2026), the Timing Analysis Agent (2025) and ORFS-agent (MLCAD 2025) apply tool-using LLM agents to ECO and timing closure. In addition, TransSizer and LEGO-Size are cited but not compared, although both target post-route gate sizing and LEGO-Size casts sizing as language modeling over timing paths. Neither the ISPD 2012/2013 gate-sizing benchmarks nor a Lagrangian-relaxation sizer is used for evaluation. Given this body of work, the contribution of combining a graph encoder, a frozen LLM, cell features and an agentic loop for sizing and Vt swapping is incremental, and the paper should position itself against these methods empirically, not only in prose.
Questions for authors
Q1. ECO-GNN (Lu et al., 2023) is a signoff power predictor. How was it converted into a timing-ECO method that proposes replacements, and in what sense is TT its training corner?
Q2. How does ECOpilot compare with PrimeTime fix_eco_timing, or Innovus post-route optimization, restricted to the same sizing and Vt-swap actions, in QoR, number of changed cells, leakage and runtime? Can ECOpilot repair violations that remain after the commercial engine converges?
Q3. What are the output heads for MGM, ATR and Stage 2, and are they trained? What are the MGM, ATR and Stage 2 results for the same GAT, features and heads with the LLM removed?
Q4. Stage 2 is trained with an MSE loss on delay change, yet the optimizer selects the action with the highest model output probability while the LM head is frozen. How is this probability computed? How does the pipeline perform if the LLM proposal is replaced by direct ranking of legal candidates by predicted delay change, or by a random legal candidate filtered with PrimeTime feedback?
Q5. How many graph tokens represent a subgraph? What are the typical and maximum prompt lengths per agent, broken down into graph tokens, cell features, few-shot examples and trajectory, as a function of K and design size? Why does the optimizer also receive textual circuit graphs?
Q6. What is the downstream ECO quality when MGM, ATR or both are removed from pretraining? How does ATR compare with a sum-of-mean-cell-delays baseline, TimingPredict and PreRoutGNN?
Q7. How does the full pipeline perform with a more recent backbone? How does it compare with a strong text-only reasoning model given the same path descriptions, cell features, candidate sets and PrimeTime feedback, but no graph tokens?
Q8. How do you position ECOpilot relative to CircuitFusion, NetTAG and Retrieve-Schedule-Reflect?