{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T21:01:15Z","timestamp":1751662875177,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530681","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"1351-1354","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Accelerator design with decoupled hardware customizations"],"prefix":"10.1145","author":[{"given":"Debjit","family":"Pal","sequence":"first","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Hsiang","family":"Lai","sequence":"additional","affiliation":[{"name":"Amazon Web Services, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojie","family":"Xiang","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niansong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongzheng","family":"Chen","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Casas","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasquale","family":"Cocchini","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenkun","family":"Yang","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Yang","sequence":"additional","affiliation":[{"name":"Intel Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"additional","affiliation":[{"name":"Colorado State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiru","family":"Zhang","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","author":"Adams A.","year":"2019","unstructured":"A. Adams, K. Ma, L. Anderson, R. Baghdadi, T.-M. Li, M. Gharbi, B. Steiner, and S. e. a. Johnson. Learning to Optimize Halide with Tree Search and Random Programs. ACM Trans. on Graphics (TOG), 2019.","journal-title":"Trans. on Graphics (TOG)"},{"key":"e_1_3_2_1_2_1","volume-title":"Pouchet. PolyCheck: Dynamic Verification of Iteration Space Transformations on Affine Programs. ACM SIGPLAN Symp. on Principles of Programming Languages (POPL)","author":"Bao W.","year":"2016","unstructured":"W. Bao, S. Krishnamoorthy, and L.-N. e. a. Pouchet. PolyCheck: Dynamic Verification of Iteration Space Transformations on Affine Programs. ACM SIGPLAN Symp. on Principles of Programming Languages (POPL), 2016."},{"key":"e_1_3_2_1_3_1","volume-title":"The Polyhedral Model is More Widely Applicable than You Think. Int'l Conf. on Compiler Construction (CC)","author":"Benabderrahmane M.-W.","year":"2010","unstructured":"M.-W. Benabderrahmane, L.-N. Pouchet, A. Cohen, and C. Bastoul. The Polyhedral Model is More Widely Applicable than You Think. Int'l Conf. on Compiler Construction (CC), 2010."},{"key":"e_1_3_2_1_4_1","volume-title":"TVM: An Automated End-to-End Optimizing Compiler for Deep Learning. USENIX Conf. on Operating Systems Design and Implementation (OSDI)","author":"Chen T.","year":"2018","unstructured":"T. Chen, T. Moreau, Z. Jiang, L. Zheng, E. Yan, M. Cowan, H. Shen, L. Wang, Y. Hu, L. Ceze, C. Guestrin, and A. Krishnamurthy. TVM: An Automated End-to-End Optimizing Compiler for Deep Learning. USENIX Conf. on Operating Systems Design and Implementation (OSDI), 2018."},{"key":"e_1_3_2_1_5_1","volume-title":"Learning to Optimize Tensor Programs. Int'l Conference on Neural Information Processing Systems (NeurIPS)","author":"Chen T.","year":"2018","unstructured":"T. Chen, L. Zheng, E. Yan, Z. Jiang, T. Moreau, L. Ceze, C. Guestrin, and A. Krishnamurthy. Learning to Optimize Tensor Programs. Int'l Conference on Neural Information Processing Systems (NeurIPS), 2018."},{"key":"e_1_3_2_1_6_1","volume-title":"High-Level Synthesis for FPGAs: From Prototyping to Deployment","author":"Cong J.","year":"2011","unstructured":"J. Cong, B. Liu, S. Neuendorffer, J. Noguera, K. Vissers, and Z. Zhang. High-Level Synthesis for FPGAs: From Prototyping to Deployment. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 2011."},{"key":"e_1_3_2_1_7_1","volume-title":"Int'l Journal of Parallel Program (JPP)","author":"Feautrier P.","year":"1991","unstructured":"P. Feautrier. Dataflow Analysis of Array and Scalar References. Int'l Journal of Parallel Program (JPP), 1991."},{"key":"e_1_3_2_1_8_1","author":"Lai Y.","year":"2021","unstructured":"Y. Lai, E. Ustun, S. Xiang, Z. Fang, H. Rong, and Z. Zhang. Programming and Synthesis for Software-defined FPGA Acceleration: Status and Future Prospects. ACM Trans. on Reconfigurable Technology and Systems (TRETS), 2021.","journal-title":"ACM Trans. on Reconfigurable Technology and Systems (TRETS)"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289602.3293910"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415644"},{"key":"e_1_3_2_1_11_1","volume-title":"MLIR: A Compiler Infrastructure for the End of Moore's Law. arXiv","author":"Lattner C.","year":"2020","unstructured":"C. Lattner, J. A. Pienaar, M. Amini, U. Bondhugula, R. Riddle, A. Cohen, T. Shpeisman, A. Davis, N. Vasilache, and O. Zinenko. MLIR: A Compiler Infrastructure for the End of Moore's Law. arXiv, 2020."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"key":"e_1_3_2_1_13_1","volume-title":"CoRR","author":"Moreau T.","year":"2018","unstructured":"T. Moreau, T. Chen, Z. Jiang, L. Ceze, C. Guestrin, and A. Krishnamurthy. VTA: An Open Hardware-Software Stack for Deep Learning. CoRR, 2018."},{"key":"e_1_3_2_1_14_1","volume-title":"Pruning and Optimization. ACM SIGPLAN Symp. on Principles of Programming Languages (POPL)","author":"Pouchet L.-N.","year":"2011","unstructured":"L.-N. Pouchet, U. Bondhugula, C. Bastoul, A. Cohen, J. Ramanujam, P. Sadayappan, and N. Vasilache. Loop Transformations: Convexity, Pruning and Optimization. ACM SIGPLAN Symp. on Principles of Programming Languages (POPL), 2011."},{"key":"e_1_3_2_1_15_1","volume-title":"Polyhedral-Based Data Reuse Optimization for Configurable Computing. Int'l Symp. on Field-Programmable Gate Arrays (FPGA)","author":"Pouchet L.-N.","year":"2013","unstructured":"L.-N. Pouchet, P. Zhang, P. Sadayappan, and J. Cong. Polyhedral-Based Data Reuse Optimization for Configurable Computing. Int'l Symp. on Field-Programmable Gate Arrays (FPGA), 2013."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462176"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490422.3502330"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2019.00033"},{"key":"e_1_3_2_1_19_1","volume-title":"Correlated Multi-objective Multi-fidelity Optimization for HLS Directives Design. Design, Automation, and Test in Europe (DATE)","author":"Sun Q.","year":"2021","unstructured":"Q. Sun, T. Chen, S. Liu, J. Miao, J. Chen, H. Yu, and B. Yu. Correlated Multi-objective Multi-fidelity Optimization for HLS Directives Design. Design, Automation, and Test in Europe (DATE), 2021."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490422.3502369"},{"key":"e_1_3_2_1_21_1","volume-title":"Accessed","author":"Zhan K.","year":"2022","unstructured":"K. Zhan, J. Guo, B. Song, W. Zhang, and Z. Bao. UltraNet: An FPGA-based Object Detection for the DAC-SDC 2020. https:\/\/github.com\/heheda365\/ultra_net. Accessed: April 18, 2022."},{"key":"e_1_3_2_1_22_1","volume-title":"Formalizing the LLVM Intermediate Representation for Verified Program Transformations. ACM SIGPLAN Symp. on Principles of Programming Languages (POPL)","author":"Zhao J.","year":"2012","unstructured":"J. Zhao, S. Nagarakatte, M. M. Martin, and S. Zdancewic. Formalizing the LLVM Intermediate Representation for Verified Program Transformations. ACM SIGPLAN Symp. on Principles of Programming Languages (POPL), 2012."},{"key":"e_1_3_2_1_23_1","volume-title":"OSDI","author":"Zheng L.","year":"2020","unstructured":"L. Zheng, C. Jia, M. Sun, Z. Wu, C. H. Yu, A. Haj-Ali, Y. Wang, J. Yang, D. Zhuo, K. Sen, J. E. Gonzalez, and I. Stoica. Ansor: Generating High-Performance Tensor Programs for Deep Learning. OSDI, 2020."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"S. Zheng Y. Liang S. Wang R. Chen and K. Sheng. FlexTensor: An Automatic Schedule Exploration and Optimization Framework for Tensor Computation on Heterogeneous System. Int'l Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS) 2020.","DOI":"10.1145\/3373376.3378508"},{"key":"e_1_3_2_1_25_1","volume-title":"Rosetta: A Realistic High-Level Synthesis Benchmark Suite for Software Programmable FPGAs. Int'l Symp. on Field-Programmable Gate Arrays (FPGA)","author":"Zhou Y.","year":"2018","unstructured":"Y. Zhou, U. Gupta, S. Dai, R. Zhao, N. Srivastava, H. Jin, J. Featherston, Y.-H. Lai, G. Liu, G. A. Velasquez, W. Wang, and Z. Zhang. Rosetta: A Realistic High-Level Synthesis Benchmark Suite for Software Programmable FPGAs. Int'l Symp. on Field-Programmable Gate Arrays (FPGA), 2018."}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"],"location":"San Francisco California","acronym":"DAC '22"},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530681","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:23Z","timestamp":1750186943000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489517.3530681"}},"subtitle":["benefits and challenges: invited"],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":25,"alternative-id":["10.1145\/3489517.3530681","10.1145\/3489517"],"URL":"https:\/\/doi.org\/10.1145\/3489517.3530681","relation":{},"subject":[],"published":{"date-parts":[[2022,7,10]]},"assertion":[{"value":"2022-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}