{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T16:46:11Z","timestamp":1764002771588,"version":"3.41.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hong Kong Innovation and Technology Commission","award":["CIMDA"],"award-info":[{"award-number":["CIMDA"]}]},{"name":"Hong Kong Research Grants Council","award":["11204821"],"award-info":[{"award-number":["11204821"]}]},{"DOI":"10.13039\/100007567","name":"City University of Hong Kong","doi-asserted-by":"crossref","award":["9610034, 9610460, and 9440356"],"award-info":[{"award-number":["9610034, 9610460, and 9440356"]}],"id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Reconfigurable Technol. Syst."],"published-print":{"date-parts":[[2025,6,30]]},"abstract":"<jats:p>Loop pipelining is a key optimization in high-level synthesis (HLS), aimed at overlapping the execution of iterations. Static scheduling, dominant in commercial HLS tools, configures the pipeline based on compile-time analysis, proving conservative for designs with irregular control flow and memory access due to imbalanced recurrences. Speculative Loop pipeline (SLP) is a novel concept that addresses the problem by introducing the speculation and recovery mechanism at the source level to improve the throughput. Although proven promising, it has a significant gap from practical application: It requires accurate early-stage modeling of the pipeline configuration for each path, which is unable to obtain with classic HLS scheduling methods because the SLP process itself interferes with the path length. In this work, we made a step forward by proposing a practical SLP framework with accurate path modeling ability through iterative tuning. We further optimize the SLP technology by combining automatic dataflow extraction with speculative source-level transformation to further boost the performance in specific design patterns. Our framework works on the source level and is easy to be plugged into existing downstream HLS tools. Experiment results demonstrate significant performance improvements over commercial HLS tools and better resource trade-offs compared to the state-of-the-art dynamic-scheduling-based solutions.<\/jats:p>","DOI":"10.1145\/3705732","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T09:46:24Z","timestamp":1732614384000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Speculative Loop Pipeline Framework with Accurate Path Modeling for High-Level Synthesis"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3748-577X","authenticated-orcid":false,"given":"Yuhan","family":"She","sequence":"first","affiliation":[{"name":"City University of Hong Kong, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5453-8925","authenticated-orcid":false,"given":"Jierui","family":"Liu","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1176-9002","authenticated-orcid":false,"given":"Yanlong","family":"Huang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6764-0729","authenticated-orcid":false,"given":"Ray C.C.","family":"Cheung","sequence":"additional","affiliation":[{"name":"Center for Intelligent Multidimensional Data Analysis, City University of Hong Kong, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9661-3095","authenticated-orcid":false,"given":"Hong","family":"Yan","sequence":"additional","affiliation":[{"name":"Center for Intelligent Multidimensional Data Analysis, City University of Hong Kong, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2629442"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488796"},{"key":"e_1_3_2_4_2","unstructured":"AMD Xilinx. 2023. Vitis High-Level Synthesis User Guide (UG1399). Retrieved August 25 2023 from https:\/\/docs.xilinx.com\/r\/en-US\/ug1399-vitis-hls"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2005.1430572"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.945302"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","unstructured":"J. Cheng. 2019. JianyiCheng: HLS Benchmarks First Release. DOI: 10.5281\/zenodo.3561115","DOI":"10.5281\/zenodo.3561115"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373087.3375297"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3065902"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2016.7577317"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147077"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021754"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3012866"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3274280"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2013.6648190"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2022.3188136"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3640537.3641581"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.5555\/832285.835535"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/EDTC.1995.470346"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2435264.2435296"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335150"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3174243.3174264"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3289602.3293914"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3105574"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597614"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477053"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3469660"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2013.6645540"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2015.31"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICFPT56656.2022.9974425"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2783363"},{"key":"e_1_3_2_32_2","unstructured":"LLVM. 2024. The LLVM Compiler Infrastructure. Retrieved from https:\/\/www.llvm.org\/"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2228270"},{"key":"e_1_3_2_34_2","unstructured":"PollyLLVM. 2024. Polly LLVM Framework for High-Level Loop and Data-Locality Optimizations. Retrieved from https:\/\/polly.llvm.org\/"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.5555\/1025127.1026007"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF03356742"},{"key":"e_1_3_2_37_2","unstructured":"Siemens. 2022. Siemens Catapult HLS. Retrieved from https:\/\/eda.sw.siemens.com\/en-US\/ic\/catapult-high-level-synthesis\/"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2014.7001431"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2015.7372553"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/224538.224648"},{"key":"e_1_3_2_41_2","first-page":"501","volume-title":"Proceedings of the International Workshop on Logic and Synthesis","author":"Venkataramani Girish","year":"2004","unstructured":"Girish Venkataramani, Mihai Budiu, Tiberiu Chelcea, and Seth C. Goldstein. 2004. C to asynchronous dataflow circuits: An end-to-end toolflow. In Proceedings of the International Workshop on Logic and Synthesis, 501\u2013508."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323639"},{"key":"e_1_3_2_43_2","unstructured":"Xilinx. 2022. Xilinx Vitis 2022.2. Retrieved from https:\/\/www.xilinx.com\/support\/download\/index.html\/content\/xilinx\/en\/downloadNav\/vitis\/2022-2.html"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543622.3573196"}],"container-title":["ACM Transactions on Reconfigurable Technology and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3705732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3705732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:13Z","timestamp":1750295893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3705732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6,30]]}},"alternative-id":["10.1145\/3705732"],"URL":"https:\/\/doi.org\/10.1145\/3705732","relation":{},"ISSN":["1936-7406","1936-7414"],"issn-type":[{"type":"print","value":"1936-7406"},{"type":"electronic","value":"1936-7414"}],"subject":[],"published":{"date-parts":[[2025,3,21]]},"assertion":[{"value":"2024-07-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}