{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:14:40Z","timestamp":1768522480938,"version":"3.49.0"},"reference-count":15,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T00:00:00Z","timestamp":1745539200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Wuhan Key Research and Development Plan","award":["2024050702030134"],"award-info":[{"award-number":["2024050702030134"]}]},{"name":"Wuhan Key Research and Development Plan","award":["2023YFE0126400"],"award-info":[{"award-number":["2023YFE0126400"]}]},{"name":"Wuhan Key Research and Development Plan","award":["202310500013"],"award-info":[{"award-number":["202310500013"]}]},{"name":"China-Sudan Joint Laboratory of New Photovoltaic Ecological Agriculture","award":["2024050702030134"],"award-info":[{"award-number":["2024050702030134"]}]},{"name":"China-Sudan Joint Laboratory of New Photovoltaic Ecological Agriculture","award":["2023YFE0126400"],"award-info":[{"award-number":["2023YFE0126400"]}]},{"name":"China-Sudan Joint Laboratory of New Photovoltaic Ecological Agriculture","award":["202310500013"],"award-info":[{"award-number":["202310500013"]}]},{"name":"College Student Innovation and Entrepreneurship Training Program","award":["2024050702030134"],"award-info":[{"award-number":["2024050702030134"]}]},{"name":"College Student Innovation and Entrepreneurship Training Program","award":["2023YFE0126400"],"award-info":[{"award-number":["2023YFE0126400"]}]},{"name":"College Student Innovation and Entrepreneurship Training Program","award":["202310500013"],"award-info":[{"award-number":["202310500013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/a18050249","type":"journal-article","created":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T08:02:57Z","timestamp":1745568177000},"page":"249","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Method for Synthesizing Ultra-Large-Scale Clock Trees"],"prefix":"10.3390","volume":"18","author":[{"given":"Ziheng","family":"Li","sequence":"first","affiliation":[{"name":"National \u201c111 Research Center\u201d Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China"}]},{"given":"Benyuan","family":"Chen","sequence":"additional","affiliation":[{"name":"National \u201c111 Research Center\u201d Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China"}]},{"given":"Wanting","family":"Wang","sequence":"additional","affiliation":[{"name":"National \u201c111 Research Center\u201d Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China"}]},{"given":"Hui","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Physics and Electromechanical Engineering, Hubei University of Education, Wuhan 430205, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4785-0910","authenticated-orcid":false,"given":"Qinghua","family":"Lv","sequence":"additional","affiliation":[{"name":"National \u201c111 Research Center\u201d Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China"}]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[{"name":"National \u201c111 Research Center\u201d Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China"}]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[{"name":"National \u201c111 Research Center\u201d Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1718-8428","authenticated-orcid":false,"given":"Juan","family":"Li","sequence":"additional","affiliation":[{"name":"National \u201c111 Research Center\u201d Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China"}]},{"given":"Cheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"National \u201c111 Research Center\u201d Microelectronics and Integrated Circuits, School of Science, Hubei University of Technology, Wuhan 430068, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s11390-015-1531-4","article-title":"Register Clustering Methodology for Low Power Clock Tree Synthesis","volume":"30","author":"Deng","year":"2015","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Kahng, A.B., Lienig, J., Markov, I.L., and Hu, J. (2011). VLSI Physical Design: From Graph Partitioning to Timing Closure, Springer. [1st ed.].","DOI":"10.1007\/978-90-481-9591-6"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/82.204128","article-title":"Zero skew clock routing with minimum wirelength","volume":"39","author":"Chao","year":"1992","journal-title":"IEEE Trans. Circuits Syst. II Analog Digit. Signal Process."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Chen, G., and Young, E.F.Y. (2019, January 25\u201329). Dim Sum: Light Clock Tree by Small Diameter Sum. Proceedings of the 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), Florence, Italy.","DOI":"10.23919\/DATE.2019.8715285"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/293625.293628","article-title":"Bounded-Skew Clock and Steiner Routing","volume":"3","author":"Cong","year":"1998","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1109\/TCAD.2019.2894653","article-title":"SALT: Provably Good Routing Topology by a Novel Steiner Shallow-Light Tree Algorithm","volume":"39","author":"Chen","year":"2020","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_7","unstructured":"Chen, G.J. (2019). VLSI Routing: Seeing Nano Tree in Giga Forest, The Chinese University of Hong Kong."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Li, W.G., Huang, Z.P., Yu, B., Zhu, W.X., and Li, X.Q. (2024, January 23\u201327). Toward Controllable Hierarchical Clock Tree Synthesis with Skew-Latency-Load Tree. Proceedings of the 61st ACM\/IEEE Design Automation Conference, San Francisco, CA, USA.","DOI":"10.1145\/3649329.3658243"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TVLSI.2018.2874572","article-title":"Slew Merging Region Propagation for Bounded Slew and Skew Clock Tree Synthesis","volume":"27","author":"Lerner","year":"2019","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Wu, G., Xu, Y., Wu, D., Ragupathy, M., Mo, Y.Y., and Chu, C. (2016, January 5\u20139). Flip-flop clustering by weighted K-means algorithm. Proceedings of the 53nd ACM\/EDAC\/IEEE Design Automation Conference (DAC), Austin, TX, USA.","DOI":"10.1145\/2897937.2898025"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TCAD.2018.2889756","article-title":"Optimal Generalized H-Tree Topology and Buffering for High-Performance and Low-Power Clock Distribution","volume":"39","author":"Han","year":"2020","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wang, H.H., Lei, Q.Q., Yang, Y.F., and Liu, L. (2022, January 1\u20133). A Clock Tree Synthesis Scheme Based On Flexible H-tree. Proceedings of the 2022 2nd International Conference on Electrical Engineering and Mechatronics Technology (ICEEMT), Hangzhou, China.","DOI":"10.1109\/ICEEMT56362.2022.9862608"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Mangiras, D., Mattheakis, P., and Ribet, P.O. (2020, January 20\u201323). Soft-Clustering Driven Flip-flop Placement Targeting Clock-induced OCV. Proceedings of the 2020 International Symposium on Physical Design, ISPD \u201920, Taipei, Taiwan.","DOI":"10.1145\/3372780.3375564"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Kundu, S., Mehta, N.A., and Sircar, A. (2022, January 11\u201314). Machine Learning Based Flip-Flop Clustering for Clock Network Power Improvement. Proceedings of the IEEE International Conference on Emerging Electronics (ICEE), Bangalore, India.","DOI":"10.1109\/ICEE56203.2022.10118234"},{"key":"ref_15","unstructured":"(2024, September 28). ISPD 2010 High Performance Clock Network Synthesis Contest. Available online: http:\/\/archive.sigda.org\/ispd\/contests\/10\/ispd10cns.html."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/5\/249\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:21:30Z","timestamp":1760030490000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/5\/249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,25]]},"references-count":15,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["a18050249"],"URL":"https:\/\/doi.org\/10.3390\/a18050249","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,25]]}}}