{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:28:02Z","timestamp":1770290882193,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,5,26]]},"DOI":"10.1145\/3728179.3728185","type":"proceedings-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T14:09:58Z","timestamp":1747318198000},"page":"131-137","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing FPGA Routing Efficiency with Graph Neural Network-Based Congestion Prediction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5798-176X","authenticated-orcid":false,"given":"Kazuki","family":"Tokuishi","sequence":"first","affiliation":[{"name":"Graduate School of Science and Technology, Kumamoto University, Kumamoto, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5196-9765","authenticated-orcid":false,"given":"Motoki","family":"Amagasaki","sequence":"additional","affiliation":[{"name":"Faculty of Advanced Science and Technology, Kumamoto University, Kumamoto, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0094-8179","authenticated-orcid":false,"given":"Masato","family":"Kiyama","sequence":"additional","affiliation":[{"name":"Faculty of Advanced Science and Technology, Kumamoto University, Kumamoto, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5391-1636","authenticated-orcid":false,"given":"Kenshu","family":"Seto","sequence":"additional","affiliation":[{"name":"Research and Education Institute for Semiconductors and Informatics (REISI), Kumamoto University, Kumamoto, Japan"}]}],"member":"320","published-online":{"date-parts":[[2025,5,25]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","unstructured":"Jason Luu Jeffrey Goeders Michael Wainberg Andrew Somerville Thien Yu Konstantin Nasartschuk Miad Nasr Sen Wang Tim Liu Nooruddin Ahmed Kenneth B. Kent Jason Anderson Jonathan Rose and Vaughn Betz. \u201cVTR 7.0: Next Generation Architecture and CAD System for FPGAs.\u201d ACM Transactions on Reconfigurable Technology and Systems (TRETS) Volume 7 Issue 2 Article No. 6 Pages 1\u201330 2014. 10.1145\/2617593.","DOI":"10.1145\/2617593"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Kevin E. Murray Scott Whitty Suya Liu Jason Luu and Vaughn Betz. \u201cTiming-Driven Titan: Enabling Large Benchmarks and Exploring the Gap between Academic and Commercial CAD.\u201d ACM Transactions on Reconfigurable Technology and Systems (TRETS) Volume 8 Issue 2 Article No. 10 Pages 1\u201318 2015. 10.1145\/2629579.","DOI":"10.1145\/2629579"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Larry McMurchie and Carl Ebeling. \u201cPathFinder: a negotiation-based performance-driven router for FPGAs.\u201d In Proceedings of the 1995 ACM Third International Symposium on Field-Programmable Gate Arrays Monterey California USA Pages 111\u2013117 1995. 10.1145\/201310.201328.","DOI":"10.1145\/201310.201328"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Vaughn Betz and Jonathan Rose. \u201cVPR: A New Packing Placement and Routing Tool for FPGA Research.\u201d In Proceedings of the 7th International Workshop on Field-Programmable Logic and Applications (FPL \u201997) Berlin Heidelberg Pages 213\u2013222 1997. https:\/\/dl.acm.org\/doi\/10.5555\/647924.738755.","DOI":"10.1007\/3-540-63465-7_226"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","unstructured":"Yue Zha and Jing Li. \u201cRevisiting PathFinder Routing Algorithm.\u201d In Proceedings of the 2022 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA \u201922) Virtual Event USA Pages 24\u201334 2022. 10.1145\/3490422.3502356.","DOI":"10.1145\/3490422.3502356"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","unstructured":"Umair Siddiqi Timothy Martin Sam Van Den Eijnden Ahmed Shamli Gary Grewal Sadiq Sait and Shawki Areibi. \u201cFaster FPGA Routing by Forecasting and Pre-Loading Congestion Information.\u201d In Proceedings of the 2022 ACM\/IEEE 4th Workshop on Machine Learning for CAD (MLCAD) Pages 15\u201320 2022. 10.1109\/MLCAD55463.2022.9900091.","DOI":"10.1109\/MLCAD55463.2022.9900091"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Leo Breiman. \u201cRandom Forests.\u201d Machine Learning Volume 45 Number 1 Pages 5\u201332 2001. 10.1023\/A:1010933404324.","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Jie Zhou Ganqu Cui Shengding Hu Zhengyan Zhang Cheng Yang Zhiyuan Liu Lifeng Wang Changcheng Li and Maosong Sun. \u201cGraph Neural Networks: A Review of Methods and Applications.\u201d AI Open Volume 1 Pages 57\u201381 2020. 10.1016\/j.aiopen.2021.01.001.","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Kevin E. Murray Sheng Zhong and Vaughn Betz. \u201cAIR: A Fast but Lazy Timing-Driven FPGA Router.\u201d In Proceedings of the 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC) Pages 338\u2013344 2020. 10.1109\/ASP-DAC47756.2020.9045175.","DOI":"10.1109\/ASP-DAC47756.2020.9045175"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","unstructured":"Kevin E. Murray Oleg Petelin Sheng Zhong Jia Min Wang Mohamed Eldafrawy Jean-Philippe Legault Eugene Sha Aaron G. Graham Jean Wu Matthew J. P. Walker Hanqing Zeng Panagiotis Patros Jason Luu Kenneth B. Kent and Vaughn Betz. \u201cVTR 8: High-performance CAD and Customizable FPGA Architecture Modelling.\u201d ACM Transactions on Reconfigurable Technology and Systems (TRETS) Volume 13 Issue 2 Article No. 9 Pages 1\u201355 2020. 10.1145\/3388617.","DOI":"10.1145\/3388617"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Cunxi Yu and Zhiru Zhang. \u201cPainting on Placement: Forecasting Routing Congestion using Conditional Generative Adversarial Nets.\u201d In Proceedings of the 56th Annual Design Automation Conference 2019 (DAC \u201919) Las Vegas NV USA 2019 Article No. 219 6 pages. 10.1145\/3316781.3317876.","DOI":"10.1145\/3316781.3317876"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Peter E. Hart Nils J. Nilsson and Bertram Raphael. \u201cA Formal Basis for the Heuristic Determination of Minimum Cost Paths.\u201d IEEE Transactions on Systems Science and Cybernetics Volume 4 Number 2 Pages 100\u2013107 1968. 10.1109\/TSSC.1968.300136.","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_3_1_14_2","unstructured":"Thomas N. Kipf and Max Welling. \u201cSemi-Supervised Classification with Graph Convolutional Networks.\u201d arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1609.02907 2017. https:\/\/arxiv.org\/abs\/1609.02907."}],"event":{"name":"HEART 2025: 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies","location":"Kumamoto Japan","acronym":"HEART 2025"},"container-title":["Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728179.3728185","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3728179.3728185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:19:06Z","timestamp":1750295946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728179.3728185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,25]]},"references-count":13,"alternative-id":["10.1145\/3728179.3728185","10.1145\/3728179"],"URL":"https:\/\/doi.org\/10.1145\/3728179.3728185","relation":{},"subject":[],"published":{"date-parts":[[2025,5,25]]},"assertion":[{"value":"2025-05-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}