Lune

DAC2025Top-tier venue

A Fast, Iterative Clock Skew Scheduling Algorithm with Dynamic Sequential Graph Extraction

Shijian Chen, Yihang Qiu, Biwei Xie, Mingyu Chen, Xingquan Li

Abstract

Clock skew scheduling (CSS) is a well-known technique that improves design timing slack by adjusting clock latency to flipflops. CSS requires obtaining timing path information between sequential elements (including flip-flops and I/O ports), known as sequential graph extraction, which is the most time-consuming part of advanced CSS. In this paper, to quickly identify the potential of clock skew in slack optimization, we propose an iterative CSS algorithm that leverages timing propagation to facilitate sequential graph extraction. Then, we provide a comprehensive skew calculation method that considers multiple clock latency constraints, obtaining the target latency of each flip-flop. Finally, we present slack optimization techniques to achieve the target latencies. Our algorithm achieves a 49.11×49.11 \times speedup compared to the advanced CSS algorithm based on partial graph extraction, reducing 90.05% of the extracted edges. Compared to a state-of-the-art CSS-based slack optimization methodology, our algorithm delivers a 27.01×27.01 \times speedup with superior slack improvement.

Ask Lune

Know where this paper stands in minutes, not an afternoon.

Lune can read the top-tier papers that cite it and the ones closest to it, and tells you what it claims, what came after and where it falls short, each point cited to the paper it comes from. No skimming, no AI slop.

Questions to start from

Lune can draw on

its abstract · related work

Get the answer

Free to start. No credit card required.

Related papers

  1. An Efficient Critical Path Generation Algorithm Considering Extensive Path ConstraintsGuannan Guo, Tsung-Wei Huang, Chun-Xun Lin, Martin D. F. WongDAC 2020 · 22 citations
  2. Toward Controllable Hierarchical Clock Tree Synthesis with Skew-Latency-Load TreeWeiguo Li, Zhipeng Huang, Bei Yu, Wenxing Zhu et al.DAC 2024 · 7 citations
  3. A Provably Good and Practically Efficient Algorithm for Common Path Pessimism Removal in Large DesignsZizheng Guo, Tsung-Wei Huang, Yibo LinDAC 2021 · 31 citations
  4. Latch Clustering for Timing-Power Co-OptimizationChau-Chin Huang, Gustavo E. Téllez, Gi-Joon Nam, Yao-Wen ChangDAC 2020 · 6 citations
  5. Ink: Efficient Incremental k-Critical Path GenerationChe Chang, Tsung-Wei Huang, Dian-Lun Lin, Guannan Guo et al.DAC 2024 · 13 citations
Dusk over the sea between two cliffs drawn in fine vertical lines