{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:23:08Z","timestamp":1774628588530,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T00:00:00Z","timestamp":1518652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1337240, 1453378, 1512937, 1618275"],"award-info":[{"award-number":["1337240, 1453378, 1512937, 1618275"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Defense Advanced Research Projects Agency","award":["HR0011-16-C-0037, D15AP00096"],"award-info":[{"award-number":["HR0011-16-C-0037, D15AP00096"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,2,15]]},"DOI":"10.1145\/3174243.3174268","type":"proceedings-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T16:12:59Z","timestamp":1519402379000},"page":"137-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["A Scalable Approach to Exact Resource-Constrained Scheduling Based on a Joint SDC and SAT Formulation"],"prefix":"10.1145","author":[{"given":"Steve","family":"Dai","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}]},{"given":"Gai","family":"Liu","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":[[2018,2,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Celerity: An Open-Source RISC-V Tiered Accelerator Fabric. Hot Chips: A Symp. on High Performance Chips","author":"T. Ajayi","year":"2017"},{"key":"e_1_3_2_1_2_1","unstructured":"Armin Biere. Lingeling Plingeling and Treengeling Entering the SAT Competition 2013. SAT Competition 2013.  Armin Biere. Lingeling Plingeling and Treengeling Entering the SAT Competition 2013. SAT Competition 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Andrew Canis Stephen D. Brown and Jason H. Anderson. Modulo SDC Scheduling with Recurrence Minimization in High-Level Synthesis. Int'l Conf. on Field Programmable Logic and Applications (FPL) 2014.  Andrew Canis Stephen D. Brown and Jason H. Anderson. Modulo SDC Scheduling with Recurrence Minimization in High-Level Synthesis. Int'l Conf. on Field Programmable Logic and Applications (FPL) 2014.","DOI":"10.1109\/FPL.2014.6927490"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950413.1950423"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2013.6654637"},{"key":"e_1_3_2_1_6_1","volume-title":"Dravnieks. Locating Minimal Infeasible Constraint Sets in Linear Programs. ORSA Journal on Computing","author":"John","year":"1991"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2110592"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147025"},{"key":"e_1_3_2_1_9_1","volume-title":"International Business Machines Corporation","author":"IBM ILOG CPLEX.","year":"2015"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593143"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021754"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995376.1995394"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/educ.1053.0020"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Yuko Hara Hiroyuki Tomiyama Shinya Honda Hiroaki Takada and Katsuya Ishii. CHStone: A Benchmark Program Suite for Practical C-Based High-Level Synthesis. Int'l Symp. on Circuits and Systems (ISCAS) 2008.  Yuko Hara Hiroyuki Tomiyama Shinya Honda Hiroaki Takada and Katsuya Ishii. CHStone: A Benchmark Program Suite for Practical C-Based High-Level Synthesis. Int'l Symp. on Circuits and Systems (ISCAS) 2008.","DOI":"10.1109\/ISCAS.2008.4541637"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0693-2"},{"key":"e_1_3_2_1_17_1","volume-title":"Jason Cong. Scheduling with Integer Time Budgeting for Low-Power Optimization. Asia and South Pacific Design Automation Conf. (ASP-DAC)","author":"Jiang Wei","year":"2008"},{"key":"e_1_3_2_1_18_1","volume-title":"Elastic Circuits. Asilomar Conf. on Signals, Systems, and Computers","author":"Josipovic Lana","year":"2017"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/649057"},{"key":"e_1_3_2_1_20_1","author":"Liu Gai","year":"2017","journal-title":"Trans. on Computer-Aided Design of Integrated Circuits and Systems (TCAD)"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2015.31"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847274"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536616.1536637"},{"key":"e_1_3_2_1_24_1","volume-title":"McGraw-Hill Higher Education","author":"Micheli Giovanni De","year":"1994"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/502175.502178"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31365-3_3"},{"key":"e_1_3_2_1_27_1","volume-title":"Mitch Mlinar. MAHA: A Program for Datapath Synthesis. Design Automation Conf. (DAC)","author":"Parker Alice C.","year":"1986"},{"key":"e_1_3_2_1_28_1","volume-title":"Solving Systems of Difference Constraints Incrementally. Algorithmica","author":"Ramalingam Ganesan","year":"1999"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.275355"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021753"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684746.2689063"},{"key":"e_1_3_2_1_32_1","unstructured":"Mingxing Tan Bin Liu Steve Dai and Zhiru Zhang. Multithreaded Pipeline Synthesis for Data-Parallel Kernels. Int'l Conf. on Computer-Aided Design (ICCAD) 2014.   Mingxing Tan Bin Liu Steve Dai and Zhiru Zhang. Multithreaded Pipeline Synthesis for Data-Parallel Kernels. Int'l Conf. on Computer-Aided Design (ICCAD) 2014."},{"key":"e_1_3_2_1_33_1","unstructured":"Mingxing Tan Gai Liu Ritchie Zhao Steve Dai and Zhiru Zhang. ElasticFlow: A Complexity-Effective Approach for Pipelining Irregular Loop Nests. Int'l Conf. on Computer-Aided Design (ICCAD) 2015.   Mingxing Tan Gai Liu Ritchie Zhao Steve Dai and Zhiru Zhang. ElasticFlow: A Complexity-Effective Approach for Pipelining Irregular Loop Nests. Int'l Conf. on Computer-Aided Design (ICCAD) 2015."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(81)90177-6"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11591191_23"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Lintao Zhang Conor F. Madigan Matthew H. Moskewicz and Sharad Malik. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. Int'l Conf. on Computer-Aided Design (ICCAD) 2001.   Lintao Zhang Conor F. Madigan Matthew H. Moskewicz and Sharad Malik. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. Int'l Conf. on Computer-Aided Design (ICCAD) 2001.","DOI":"10.1145\/774572.774637"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"X. Zhang X. Liu A. Ramachandran C. Zhuge S. Tang P. Ouyang Z. Cheng K. Rupnow and D. Chen. High-Performance Video Content Recognition with Long-Term Recurrent Convolutional Network for FPGA. Int'l Conf. on Field Programmable Logic and Applications (FPL) 2017.  X. Zhang X. Liu A. Ramachandran C. Zhuge S. Tang P. Ouyang Z. Cheng K. Rupnow and D. Chen. High-Performance Video Content Recognition with Long-Term Recurrent Convolutional Network for FPGA. Int'l Conf. on Field Programmable Logic and Applications (FPL) 2017.","DOI":"10.23919\/FPL.2017.8056833"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjtsldm.8.12"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Zhiru Zhang and Bin Liu. SDC-Based Modulo Scheduling for Pipeline Synthesis. Int'l Conf. on Computer-Aided Design (ICCAD) 2013.   Zhiru Zhang and Bin Liu. SDC-Based Modulo Scheduling for Pipeline Synthesis. Int'l Conf. on Computer-Aided Design (ICCAD) 2013.","DOI":"10.1109\/ICCAD.2013.6691121"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744801"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554688.2554775"}],"event":{"name":"FPGA '18: The 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","location":"Monterey CALIFORNIA USA","acronym":"FPGA '18","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3174243.3174268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3174243.3174268","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3174243.3174268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:33Z","timestamp":1750212693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3174243.3174268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,15]]},"references-count":41,"alternative-id":["10.1145\/3174243.3174268","10.1145\/3174243"],"URL":"https:\/\/doi.org\/10.1145\/3174243.3174268","relation":{},"subject":[],"published":{"date-parts":[[2018,2,15]]},"assertion":[{"value":"2018-02-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}