{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T09:10:36Z","timestamp":1774775436601,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"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:\/\/linproxy.fan.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1723773, CCF-1937599"],"award-info":[{"award-number":["CCF-1723773, CCF-1937599"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","award":["36888881"],"award-info":[{"award-number":["36888881"]}],"id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,10]]},"DOI":"10.1145\/3489517.3530409","type":"proceedings-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T23:19:29Z","timestamp":1661296769000},"page":"55-60","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Automated accelerator optimization aided by graph neural networks"],"prefix":"10.1145","author":[{"given":"Atefeh","family":"Sohrabizadeh","sequence":"first","affiliation":[{"name":"University of California"}]},{"given":"Yunsheng","family":"Bai","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Yizhou","family":"Sun","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Jason","family":"Cong","sequence":"additional","affiliation":[{"name":"University of California"}]}],"member":"320","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"J. Cong et al. 2016. Source-to-source optimization for HLS. In FPGAs for Software Programmers. 137--163.","DOI":"10.1007\/978-3-319-26408-0_8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"J. Cong et al. 2016. Software infrastructure for enabling FPGA-based accelerations in data centers. In ISLPED. 154--155.","DOI":"10.1145\/2934583.2953984"},{"key":"e_1_3_2_1_3_1","unstructured":"C. Cummins et al. 2021. ProGraML: A Graph-based Program Representation for Data Flow Analysis and Compiler Optimizations. (2021)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/1748-0221\/13\/07\/P07027"},{"key":"e_1_3_2_1_5_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma D. P.","year":"2014","unstructured":"D. P. Kingma et al. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_6_1","unstructured":"T. N. Kipf et al. 2017. Semi-supervised classification with graph convolutional networks. ICLR (2017)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"J. Kwon et al. 2020. Transfer Learning for Design-Space Exploration with High-Level Synthesis. In 2020 ACM\/IEEE MLCAD.","DOI":"10.1145\/3380446.3430636"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_1_9_1","unstructured":"Y. Li et al. 2016. Gated graph sequence neural networks. ICLR (2016)."},{"key":"e_1_3_2_1_10_1","first-page":"2579","article-title":"Visualizing data using t-SNE","author":"Maaten L.","year":"2008","unstructured":"L. v. d. Maaten et al. 2008. Visualizing data using t-SNE. Journal of machine learning research 9, Nov (2008), 2579--2605.","journal-title":"Journal of machine learning research 9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"A. Mahapatra et al. 2014. Machine-learning based simulated annealer method for high level synthesis design space exploration. In ESLsyn.","DOI":"10.1109\/ESLsyn.2014.6850383"},{"key":"e_1_3_2_1_12_1","unstructured":"A. Paszke et al. 2019. PyTorch: An Imperative Style High-Performance Deep Learning Library. In Advances in Neural Information Processing Systems 32."},{"key":"e_1_3_2_1_13_1","volume-title":"Machsuite: Benchmarks for accelerator design and customized architectures. In IISWC.","author":"Reagen B.","year":"2014","unstructured":"B. Reagen et al. 2014. Machsuite: Benchmarks for accelerator design and customized architectures. In IISWC."},{"key":"e_1_3_2_1_14_1","unstructured":"B. C. Schafer et al. 2019. High-Level Synthesis Design Space Exploration: Past Present and Future. IEEE TCAD (2019)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Y. Shi et al. 2021. Masked label prediction: Unified message passing model for semi-supervised classification. IJCAI (2021).","DOI":"10.24963\/ijcai.2021\/214"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"A. Sohrabizadeh et al. 2020. End-to-End Optimization of Deep Learning Applications. In FPGA. 133--139.","DOI":"10.1145\/3373087.3375321"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3494534"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"E. Ustun et al. 2020. Accurate operation delay prediction for FPGA HLS using graph neural networks. In ICCAD.","DOI":"10.1145\/3400302.3415657"},{"key":"e_1_3_2_1_19_1","unstructured":"A. Vaswani et al. 2017. Attention is all you need. In NeurIPS. 5998--6008."},{"key":"e_1_3_2_1_20_1","unstructured":"P. Veli\u010dkovi\u0107 et al. 2018. Graph attention networks. ICLR (2018)."},{"key":"e_1_3_2_1_21_1","unstructured":"N. Wu et al. 2021. IronMan: GNN-assisted Design Space Exploration in High-Level Synthesis via Reinforcement Learning. arXiv:2102.08138 (2021)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Z. Wu et al. 2020. A comprehensive survey on graph neural networks. IEEE transactions on neural networks and learning systems 32 1 (2020) 4--24.","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Machine Learning. PMLR, 5453--5462","author":"Xu K.","year":"2018","unstructured":"K. Xu et al. 2018. Representation learning on graphs with jumping knowledge networks. In International Conference on Machine Learning. PMLR, 5453--5462."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"C. H. Yu et al. 2018. S2FA: an accelerator automation framework for heterogeneous computing in datacenters. In DAC. 1--6.","DOI":"10.1145\/3195970.3196109"},{"key":"e_1_3_2_1_25_1","unstructured":"T. Yuki et al. PolyBench\/C. ([n. d.]). https:\/\/linproxy.fan.workers.dev:443\/https\/web.cse.ohio-state.edu\/~pouchet.2\/software\/polybench\/"},{"key":"e_1_3_2_1_26_1","volume-title":"COMBA: A comprehensive model-based analysis framework for high level synthesis of real applications. In ICCAD. 430--437.","author":"Zhao J.","year":"2017","unstructured":"J. Zhao et al. 2017. COMBA: A comprehensive model-based analysis framework for high level synthesis of real applications. In ICCAD. 430--437."}],"event":{"name":"DAC '22: 59th ACM\/IEEE Design Automation Conference","location":"San Francisco California","acronym":"DAC '22","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA"]},"container-title":["Proceedings of the 59th ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3489517.3530409","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530409","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3489517.3530409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:39Z","timestamp":1750191519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3489517.3530409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,10]]},"references-count":26,"alternative-id":["10.1145\/3489517.3530409","10.1145\/3489517"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/3489517.3530409","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"}}]}}