{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:09Z","timestamp":1750221129084,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T00:00:00Z","timestamp":1550620800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P010040\/1"],"award-info":[{"award-number":["EP\/P010040\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,2,20]]},"DOI":"10.1145\/3289602.3293899","type":"proceedings-article","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:12:13Z","timestamp":1550873533000},"page":"142-151","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["EASY"],"prefix":"10.1145","author":[{"given":"Jianyi","family":"Cheng","sequence":"first","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shane T.","family":"Fleming","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu Ting","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason H.","family":"Anderson","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George A.","family":"Constantinides","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,2,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2514740"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2675359"},{"volume-title":"https:\/\/aws.amazon.com\/","year":"2018","key":"e_1_3_2_1_3_1","unstructured":"Amazon EC2 F1 instances. 2018. ( 2018 ). https:\/\/aws.amazon.com\/ Amazon EC2 F1 instances. 2018. (2018). https:\/\/aws.amazon.com\/"},{"key":"e_1_3_2_1_4_1","unstructured":"C. Lattner and V. Adve. 2004. LLVM: a compilation framework for lifelong program analysis & transformation. In CGO. IEEE San Jose CA.   C. Lattner and V. Adve. 2004. LLVM: a compilation framework for lifelong program analysis & transformation. In CGO. IEEE San Jose CA."},{"volume-title":"https:\/\/clang.llvm.org\/","year":"2018","key":"e_1_3_2_1_6_1","unstructured":"Clang. 2018. ( 2018 ). https:\/\/clang.llvm.org\/ Clang. 2018. (2018). https:\/\/clang.llvm.org\/"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684746.2689073"},{"key":"e_1_3_2_1_8_1","volume-title":"https:\/\/www.altera.com\/","author":"Compiler HLS","year":"2017","unstructured":"Intel HLS Compiler . 2017. ( 2017 ). https:\/\/www.altera.com\/ Intel HLS Compiler. 2017. (2017). https:\/\/www.altera.com\/"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3174243.3174251"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2010.28"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2007.19"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2889160.2889163"},{"volume-title":"https:\/\/www.microsoft.com\/","year":"2018","key":"e_1_3_2_1_14_1","unstructured":"Microsoft Project Catapult. 2018. ( 2018 ). https:\/\/www.microsoft.com\/ Microsoft Project Catapult. 2018. (2018). https:\/\/www.microsoft.com\/"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2009.69"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"S. T. Fleming and D. B. Thomas. 2017. Using Runahead Execution to Hide Memory Latency in High Level Synthesis. In FCCM. IEEE Napa CA USA.  S. T. Fleming and D. B. Thomas. 2017. Using Runahead Execution to Hide Memory Latency in High Level Synthesis. In FCCM. IEEE Napa CA USA.","DOI":"10.1109\/FCCM.2017.33"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"V.G. Castellana A. Tumeo and F. Ferrandi. 2014. High-level Synthesis of Memory Bound and Irregular Parallel Applications with Bambu. In HCS. IEEE Cupertino CA USA.  V.G. Castellana A. Tumeo and F. Ferrandi. 2014. High-level Synthesis of Memory Bound and Irregular Parallel Applications with Bambu. In HCS. IEEE Cupertino CA USA.","DOI":"10.1109\/HOTCHIPS.2014.7478841"},{"key":"e_1_3_2_1_18_1","unstructured":"Xilinx. 2016. SDAccel Development Environment - User Guide (v206.2). (2016).  Xilinx. 2016. SDAccel Development Environment - User Guide (v206.2). (2016)."},{"key":"e_1_3_2_1_19_1","volume-title":"https:\/\/www.xilinx.com\/","author":"LS.","year":"2017","unstructured":"Xilinx Vivado H LS. 2017. ( 2017 ). https:\/\/www.xilinx.com\/ Xilinx Vivado HLS. 2017. (2017). https:\/\/www.xilinx.com\/"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554688.2554780"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021734"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Y.T. Chen and J.H. Anderson. 2017. Automated Generation of Banked Memory Architectures in the High-Level Synthesis of Multi-Threaded Software. In FPL. IEEE Ghent Belgium.  Y.T. Chen and J.H. Anderson. 2017. Automated Generation of Banked Memory Architectures in the High-Level Synthesis of Multi-Threaded Software. In FPL. IEEE Ghent Belgium.","DOI":"10.23919\/FPL.2017.8056841"}],"event":{"name":"FPGA '19: The 2019 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Seaside CA USA","acronym":"FPGA '19"},"container-title":["Proceedings of the 2019 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289602.3293899","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3289602.3293899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:22Z","timestamp":1750208542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289602.3293899"}},"subtitle":["Efficient Arbiter SYnthesis from Multi-threaded Code"],"short-title":[],"issued":{"date-parts":[[2019,2,20]]},"references-count":21,"alternative-id":["10.1145\/3289602.3293899","10.1145\/3289602"],"URL":"https:\/\/doi.org\/10.1145\/3289602.3293899","relation":{},"subject":[],"published":{"date-parts":[[2019,2,20]]},"assertion":[{"value":"2019-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}