A Method for Synthesizing Ultra-Large-Scale Clock Trees
Open Access
- 25 April 2025
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 18 (5) , 249
Abstract
As integrated circuit technology continues to advance, clock tree synthesis has become increasingly significant in the design of ultra-large-scale integrated circuits. Traditional clock tree synthesis methods often face challenges such as insufficient computational resources and buffer fan-out limitations when dealing with ultra-large-scale clock trees. To address this issue, this paper proposes an improved clock tree synthesis algorithm called incomplete balanced KSR (IB-KSR). Building upon the KSR algorithm, this proposed algorithm efficiently reduces the consumption of computational resources and constrains the fan-out of each buffer by incorporating incomplete minimum spanning tree (IMST) technology and a clustering strategy grounded in Balanced Split. In experiments, the IB-KSR algorithm was compared with the GSR algorithm. The results indicated that IB-KSR reduced the global skew of the clock tree by 43.4% and decreased the average latency by 34.3%. Furthermore, during program execution, IB-KSR maintained low computational resource consumption.Keywords
Funding Information
- Wuhan Key research and development plan (2024050702030134, 2023YFE0126400, 202310500013)
- China-Sudan Joint Laboratory of New Photovoltaic Ecological Agriculture (2024050702030134, 2023YFE0126400, 202310500013)
- College Student Innovation and Entrepreneurship Training Program (2024050702030134, 2023YFE0126400, 202310500013)
This publication has 13 references indexed in Scilit:
- Machine Learning Based Flip-Flop Clustering for Clock Network Power Improvement2022
- A Clock Tree Synthesis Scheme Based On Flexible H-tree2022
- SALT: Provably Good Routing Topology by a Novel Steiner Shallow-Light Tree AlgorithmIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019
- Optimal Generalized H-Tree Topology and Buffering for High-Performance and Low-Power Clock DistributionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018
- Slew Merging Region Propagation for Bounded Slew and Skew Clock Tree SynthesisIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2018
- Flip-flop clustering by weighted K-means algorithm2016
- Register Clustering Methodology for Low Power Clock Tree SynthesisJournal of Computer Science and Technology, 2015
- VLSI Physical Design: From Graph Partitioning to Timing Closure2011
- Bounded-skew clock and Steiner routingACM Transactions on Design Automation of Electronic Systems, 1998
- Zero skew clock routing with minimum wirelengthIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992