{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T21:01:08Z","timestamp":1751662868180,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,2,22]],"date-time":"2015-02-22T00:00:00Z","timestamp":1424563200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["1337240"],"award-info":[{"award-number":["1337240"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,2,22]]},"DOI":"10.1145\/2684746.2689063","type":"proceedings-article","created":{"date-parts":[[2015,2,10]],"date-time":"2015-02-10T13:19:52Z","timestamp":1423574392000},"page":"190-199","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Mapping-Aware Constrained Scheduling for LUT-Based FPGAs"],"prefix":"10.1145","author":[{"given":"Mingxing","family":"Tan","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Steve","family":"Dai","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Udit","family":"Gupta","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Zhiru","family":"Zhang","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/361604.361619"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/LES.2010.2055231"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/517947"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"A. Canis S. Brown and J. Anderson. Modulo SDC Scheduling with Recurrence Minimization in High-Level Synthesis. Int'l Conf. on Field Programmable Logic and Applications (FPL) pages 1--8 2014. A. Canis S. Brown and J. Anderson. Modulo SDC Scheduling with Recurrence Minimization in High-Level Synthesis. Int'l Conf. on Field Programmable Logic and Applications (FPL) pages 1--8 2014.","DOI":"10.1109\/FPL.2014.6927490"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382677"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1561\/1000000003"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/360276.360298"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.273754"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/201310.201322"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160916.2160952"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2110592"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687410"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837401"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/296399.296425"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147025"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593143"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1128020.1128563"},{"key":"e_1_3_2_1_18_1","unstructured":"Y. Hara H. Tomiyama S. Honda H. Takada and K. Ishii. CHStone: A Benchmark Program Suite for Practical C-Based High-Level Synthesis. Int'l Symp. on Circuits and Systems (ISCAS) pages 1192--1195 2008. Y. Hara H. Tomiyama S. Honda H. Takada and K. Ishii. CHStone: A Benchmark Program Suite for Practical C-Based High-Level Synthesis. Int'l Symp. on Circuits and Systems (ISCAS) pages 1192--1195 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"C. Lattner and V. Adve. LLVM: a Compilation Framework for Lifelong Program Analysis & Transformation. Int'l Symp. on Code Generation and Optimization (CGO) pages 75--86 2004. C. Lattner and V. Adve. LLVM: a Compilation Framework for Lifelong Program Analysis & Transformation. Int'l Symp. on Code Generation and Optimization (CGO) pages 75--86 2004.","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1991.3.3.440"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147035"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.703830"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/275107.275118"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.31522"},{"volume-title":"MIT","year":"1977","author":"Pratt V.","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1321"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"M. Tan B. Liu S. Dai and Z. Zhang. Multithreaded Pipeline Synthesis for Data-parallel Kernels. Int'l Conf. on Computer-Aided Design (ICCAD) pages 718--725 2014. M. Tan B. Liu S. Dai and Z. Zhang. Multithreaded Pipeline Synthesis for Data-parallel Kernels. Int'l Conf. on Computer-Aided Design (ICCAD) pages 718--725 2014.","DOI":"10.1109\/ICCAD.2014.7001431"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1723112.1723124"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Z. Zhang and B. Liu. SDC-Based Modulo Scheduling for Pipeline Synthesis. Int'l Conf. on Computer-Aided Design (ICCAD) pages 211--218 2013. Z. Zhang and B. Liu. SDC-Based Modulo Scheduling for Pipeline Synthesis. Int'l Conf. on Computer-Aided Design (ICCAD) pages 211--218 2013.","DOI":"10.1109\/ICCAD.2013.6691121"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554688.2554775"}],"event":{"name":"FPGA '15: The 2015 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"FPGA '15"},"container-title":["Proceedings of the 2015 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2684746.2689063","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2684746.2689063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:16Z","timestamp":1750227196000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2684746.2689063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,22]]},"references-count":31,"alternative-id":["10.1145\/2684746.2689063","10.1145\/2684746"],"URL":"https:\/\/doi.org\/10.1145\/2684746.2689063","relation":{},"subject":[],"published":{"date-parts":[[2015,2,22]]},"assertion":[{"value":"2015-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}