mlsanityData to 7 Oct 2026

SwiftCTS: Fast Cross-Design Prediction and Pareto Optimization of Clock Tree Metrics via Few-Shot Calibration

arXiv 2606.11348 ↗First posted 9 Jun 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Clock Tree Synthesis (CTS) is a computationally expensive stage in the physical design flow, requiring iterative EDA tool invocations to navigate a vast configuration space for optimal power, wirelength, and timing skew. Existing machine learning approaches require computationally expensive retraining or fine-tuning cycles to adapt to unseen macro architectures and are architecturally mismatched to the millions of evaluations demanded by exhaustive combinatorial search. We present SwiftCTS, a physics-informed surrogate framework that addresses both limitations simultaneously. By coupling lightweight, physics-grounded statistical features with gradient-boosted ensembles, SwiftCTS trains in under five seconds on a CPU and delivers sub-millisecond inference without GPU support. To handle out-of-distribution (OOD) designs without retraining or fine-tuning, we introduce a K-shot multiplicative calibration mechanism that anchors predictions to just one or two physical reference runs, reducing power prediction error from 24.5% to 3.3% and wirelength error from 56.6% to under 1% on unseen macros. Integrating this engine with an evolutionary optimizer, SwiftCTS evaluates 100,000 CTS configurations in under ten seconds, yielding Pareto-optimal frontiers that are physically validated within the OpenROAD flow. Closed-loop validation confirms prediction errors below 0.5% for power and wirelength, and timing skew predictions within five picoseconds on an OOD benchmark, consistently outperforming default tool heuristics across all target metrics. Code publicly available at: hrefhttps://anonymous.4open.science/r/SwiftCTS-7E6Ehttps://github.com/BarsatKhadka/SwiftCTS

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 26 references that are in the map. First posted on arXiv 9 Jun 2026.

Builds on

6 of 26 references.

References · 6

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2023ChatEDA: A Large Language Model Powered Autonomous Agent for EDAcited by 118
  3. 2021Generalizable Cross-Graph Embedding for GNN-based Congestion Predictioncited by 17
  4. 2025Spec2RTL-Agent: Automated Hardware Code Generation from Complex Specifications Using LLM Agent Systemscited by 17
  5. 2026Report for NSF Workshop on AI for Electronic Design Automationcited by 1
  6. 2026CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesiscited by 1

Built on by

Not cited yet.