{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T02:26:02Z","timestamp":1773195962607,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,23]],"date-time":"2020-02-23T00:00:00Z","timestamp":1582416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EPSRC","award":["EP\/P010040\/1, EP\/R006865\/1"],"award-info":[{"award-number":["EP\/P010040\/1, EP\/R006865\/1"]}]},{"name":"Royal Academy of Engineering and Imagination Technologies"},{"name":"Google","award":["PhD Fellowship in Systems and Networking"],"award-info":[{"award-number":["PhD Fellowship in Systems and Networking"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,23]]},"DOI":"10.1145\/3373087.3375297","type":"proceedings-article","created":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T16:44:40Z","timestamp":1582562680000},"page":"288-298","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Combining Dynamic &amp; Static Scheduling in High-level Synthesis"],"prefix":"10.1145","author":[{"given":"Jianyi","family":"Cheng","sequence":"first","affiliation":[{"name":"Imperial College London, London, United Kingdom"}]},{"given":"Lana","family":"Josipovic","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"George A.","family":"Constantinides","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}]},{"given":"Paolo","family":"Ienne","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"John","family":"Wickerson","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2020,2,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488796"},{"key":"e_1_3_2_1_2_1","volume-title":"Pegasus: An Efficient Intermediate Representation","author":"Budiu Mihai","year":"2002","unstructured":"Mihai Budiu and Seth Copen Goldstein . 2002 . Pegasus: An Efficient Intermediate Representation . Technical Report Carnegie Mellon University-CS-02--107. Carnegie Mellon University . 20 pages. Mihai Budiu and Seth Copen Goldstein. 2002. Pegasus: An Efficient Intermediate Representation . Technical Report Carnegie Mellon University-CS-02--107. Carnegie Mellon University. 20 pages."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950413.1950423"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2480849"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.945302"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2014.7478841"},{"key":"e_1_3_2_1_7_1","unstructured":"Celoxica. 2005. Handel-C . http:\/\/www.celoxica.com  Celoxica. 2005. Handel-C . http:\/\/www.celoxica.com"},{"key":"e_1_3_2_1_8_1","unstructured":"Charles Seitz. 1980. System Timing.  Charles Seitz. 1980. System Timing."},{"key":"#cr-split#-e_1_3_2_1_9_1.1","unstructured":"Jianyi Cheng. 2019 a. Datasets for Combining Dynamic & Static Scheduling in High-level Synthesis . http:\/\/doi.org\/10.5281\/zenodo.3406553 10.5281\/zenodo.3406553"},{"key":"#cr-split#-e_1_3_2_1_9_1.2","doi-asserted-by":"crossref","unstructured":"Jianyi Cheng. 2019 a. Datasets for Combining Dynamic & Static Scheduling in High-level Synthesis . http:\/\/doi.org\/10.5281\/zenodo.3406553","DOI":"10.1145\/3373087.3375297"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Jianyi Cheng. 2019 b. DSS: Combining Dynamic & Static Scheduling in High-level Synthesis . https:\/\/github.com\/JianyiCheng\/DSS  Jianyi Cheng. 2019 b. DSS: Combining Dynamic & Static Scheduling in High-level Synthesis . https:\/\/github.com\/JianyiCheng\/DSS","DOI":"10.1145\/3373087.3375297"},{"key":"#cr-split#-e_1_3_2_1_11_1.1","unstructured":"Jianyi Cheng. 2019 c. HLS-benchmarks . https:\/\/doi.org\/10.5281\/zenodo.3561115 10.5281\/zenodo.3561115"},{"key":"#cr-split#-e_1_3_2_1_11_1.2","unstructured":"Jianyi Cheng. 2019 c. HLS-benchmarks . https:\/\/doi.org\/10.5281\/zenodo.3561115"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147025"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2009.80"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593143"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021754"},{"key":"e_1_3_2_1_16_1","first-page":"2","article-title":"The CORDIC Algorithm","volume":"42","author":"Duprat Jean","year":"1993","unstructured":"Jean Duprat and Jean-Michel Muller . 1993 . The CORDIC Algorithm : New Results for Fast VLSI Implementation. IEEE Trans. Comput. , Vol. 42 , 2 (Feb. 1993), 168--178. Jean Duprat and Jean-Michel Muller. 1993. The CORDIC Algorithm: New Results for Fast VLSI Implementation. IEEE Trans. Comput. , Vol. 42, 2 (Feb. 1993), 168--178.","journal-title":"New Results for Fast VLSI Implementation. IEEE Trans. Comput."},{"key":"e_1_3_2_1_17_1","volume-title":"Throughput Analysis of Synchronous Data Flow Graphs. In Sixth International Conference on Application of Concurrency to System Design (ACSD'06)","author":"Ghamarian Amir H.","unstructured":"Amir H. Ghamarian , Marc C. W. Geilen , Sander Stuijk , Twan Basten , Bart D. Theelen , Mohammad R. Mousavi , Arno J. M. Moonen , and Marco J. G. Bekooij . 2006 . Throughput Analysis of Synchronous Data Flow Graphs. In Sixth International Conference on Application of Concurrency to System Design (ACSD'06) . IEEE, Turku, Finland, 25--36. Amir H. Ghamarian, Marc C. W. Geilen, Sander Stuijk, Twan Basten, Bart D. Theelen, Mohammad R. Mousavi, Arno J. M. Moonen, and Marco J. G. Bekooij. 2006. Throughput Analysis of Synchronous Data Flow Graphs. In Sixth International Conference on Application of Concurrency to System Design (ACSD'06) . IEEE, Turku, Finland, 25--36."},{"key":"e_1_3_2_1_18_1","unstructured":"Ian Page and Wayne Luk. 1991. Compiling occam into Field-Programmable Gate Arrays. In FPGAs W. Moore and W. Luk Eds. Abingdon EE&CS Books.  Ian Page and Wayne Luk. 1991. Compiling occam into Field-Programmable Gate Arrays. In FPGAs W. Moore and W. Luk Eds. Abingdon EE&CS Books."},{"key":"e_1_3_2_1_19_1","volume-title":"Design Automation for Embedded Systems","volume":"6","author":"Giovanni De Micheli Vincent John","year":"2000","unstructured":"Vincent John Mooney III and Giovanni De Micheli . 2000 . Hardware\/Software Co-Design of Run-Time Schedulers for Real-Time Systems . Design Automation for Embedded Systems , Vol. 6 , 1 (01 Sep 2000), 89--144. Vincent John Mooney III and Giovanni De Micheli. 2000. Hardware\/Software Co-Design of Run-Time Schedulers for Real-Time Systems. Design Automation for Embedded Systems , Vol. 6, 1 (01 Sep 2000), 89--144."},{"key":"e_1_3_2_1_20_1","unstructured":"Intel HLS Compiler. 2017. https:\/\/www.altera.com\/  Intel HLS Compiler. 2017. https:\/\/www.altera.com\/"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126525"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3174243.3174264"},{"key":"e_1_3_2_1_23_1","volume-title":"Offline Synthesis of Online Dependence Testing: Parametric Loop Pipelining for HLS. In 2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines. IEEE","author":"Liu Junyi","unstructured":"Junyi Liu , Samuel Bayliss , and George A. Constantinides . 2015 . Offline Synthesis of Online Dependence Testing: Parametric Loop Pipelining for HLS. In 2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines. IEEE , Vancouver, BC, 159--162. Junyi Liu, Samuel Bayliss, and George A. Constantinides. 2015. Offline Synthesis of Online Dependence Testing: Parametric Loop Pipelining for HLS. In 2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines. IEEE, Vancouver, BC, 159--162."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SAMOS.2011.6045491"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2015.7372553"},{"key":"e_1_3_2_1_26_1","volume-title":"IEEE 13th International Workshop on Logic Synthesis (IWLS). IEEE","author":"Venkataramani Girish","year":"2004","unstructured":"Girish Venkataramani , Mihai Budiu , Tiberiu Chelcea , and Seth Copen Goldstein . 2004 . C to Asynchronous Dataflow Circuits: An End-to-End Toolflow . In IEEE 13th International Workshop on Logic Synthesis (IWLS). IEEE , Temecula, CA. Girish Venkataramani, Mihai Budiu, Tiberiu Chelcea, and Seth Copen Goldstein. 2004. C to Asynchronous Dataflow Circuits: An End-to-End Toolflow. In IEEE 13th International Workshop on Logic Synthesis (IWLS). IEEE, Temecula, CA."},{"key":"e_1_3_2_1_27_1","volume-title":"2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE","author":"Wang Erwei","unstructured":"Erwei Wang , James J. Davis , Peter Y. K. Cheung , and George A. Constantinides . 2019. LUTNet: Rethinking Inference in FPGA Soft Logic . In 2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE , San Diego, CA, 26--34. Erwei Wang, James J. Davis, Peter Y. K. Cheung, and George A. Constantinides. 2019. LUTNet: Rethinking Inference in FPGA Soft Logic . In 2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE, San Diego, CA, 26--34."},{"key":"e_1_3_2_1_28_1","unstructured":"Xilinx Vivado HLS. 2017. https:\/\/www.xilinx.com\/  Xilinx Vivado HLS. 2017. https:\/\/www.xilinx.com\/"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2013.6691121"}],"event":{"name":"FPGA '20: The 2020 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","location":"Seaside CA USA","acronym":"FPGA '20","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2020 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373087.3375297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373087.3375297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:26Z","timestamp":1750200086000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373087.3375297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,23]]},"references-count":31,"alternative-id":["10.1145\/3373087.3375297","10.1145\/3373087"],"URL":"https:\/\/doi.org\/10.1145\/3373087.3375297","relation":{},"subject":[],"published":{"date-parts":[[2020,2,23]]},"assertion":[{"value":"2020-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}