{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T03:16:04Z","timestamp":1782184564736,"version":"3.54.5"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T00:00:00Z","timestamp":1628726400000},"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":["ACM Trans. Reconfigurable Technol. Syst."],"published-print":{"date-parts":[[2021,9,30]]},"abstract":"<jats:p>The ability to accurately and efficiently estimate the routability of a circuit based on its placement is one of the most challenging and difficult tasks in the Field Programmable Gate Array (FPGA) flow. In this article, we present a novel, deep learning framework based on a Convolutional Neural Network (CNN) model for predicting the routability of a placement. Since the performance of the CNN model is strongly dependent on the hyper-parameters selected for the model, we perform an exhaustive parameter tuning that significantly improves the model\u2019s performance and we also avoid overfitting the model. We also incorporate the deep learning model into a state-of-the-art placement tool and show how the model can be used to (1) avoid costly, but futile, place-and-route iterations, and (2) improve the placer\u2019s ability to produce routable placements for hard-to-route circuits using feedback based on routability estimates generated by the proposed model. The model is trained and evaluated using over 26K placement images derived from 372 benchmarks supplied by Xilinx Inc. We also explore several opportunities to further improve the reliability of the predictions made by the proposed DLRoute technique by splitting the model into two separate deep learning models for (a) global and (b) detailed placement during the optimization process. Experimental results show that the proposed framework achieves a routability prediction accuracy of 97% while exhibiting runtimes of only a few milliseconds.<\/jats:p>","DOI":"10.1145\/3465373","type":"journal-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T14:51:22Z","timestamp":1628779882000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["A Deep Learning Framework to Predict Routability for FPGA Circuit Placement"],"prefix":"10.1145","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2187-0406","authenticated-orcid":false,"given":"Abeer","family":"Al-Hyari","sequence":"first","affiliation":[{"name":"University of Guelph, Guelph, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hannah","family":"Szentimrey","sequence":"additional","affiliation":[{"name":"University of Guelph, Guelph, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmed","family":"Shamli","sequence":"additional","affiliation":[{"name":"University of Guelph, Guelph, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timothy","family":"Martin","sequence":"additional","affiliation":[{"name":"University of Guelph, Guelph, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gary","family":"Gr\u00e9wal","sequence":"additional","affiliation":[{"name":"University of Guelph, Guelph, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shawki","family":"Areibi","sequence":"additional","affiliation":[{"name":"University of Guelph, Guelph, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3233244"},{"key":"e_1_2_1_2_1","first-page":"1","article-title":"Design space exploration of convolutional neural networks based on evolutionary algorithms","volume":"3","author":"Al-Hyari A.","year":"2017","unstructured":"A. Al-Hyari and S. Areibi . 2017 . Design space exploration of convolutional neural networks based on evolutionary algorithms . J. Computat. Vis. Imag. Syst. 3 , 1 (Oct. 2017), 1\u20133. A. Al-Hyari and S. Areibi. 2017. Design space exploration of convolutional neural networks based on evolutionary algorithms. J. Computat. Vis. Imag. Syst. 3, 1 (Oct. 2017), 1\u20133.","journal-title":"J. Computat. Vis. Imag. Syst."},{"key":"e_1_2_1_3_1","volume-title":"International Conference on Field Programmable Logic and Applications. 1\u20138.","author":"Alhyari A.","unstructured":"A. Alhyari , A. Shamli , Z. Abuowaimer , G. Grewal , and S. Areibi . 2019. A deep learning framework to predict routability for FPGA circuit placement . In International Conference on Field Programmable Logic and Applications. 1\u20138. A. Alhyari, A. Shamli, Z. Abuowaimer, G. Grewal, and S. Areibi. 2019. A deep learning framework to predict routability for FPGA circuit placement. In International Conference on Field Programmable Logic and Applications. 1\u20138."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.251146"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/157485.164915"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3036669.3036681"},{"key":"e_1_2_1_7_1","volume-title":"International Conference on Computer Design (ICCD\u201916)","author":"Chan W. T. J.","unstructured":"W. T. J. Chan , Y. Du , A. B. Kahng , S. Nath , and K. Samadi . 2016. BEOL stack-aware routability prediction from placement using data mining techniques . In International Conference on Computer Design (ICCD\u201916) . 41\u201348. W. T. J. Chan, Y. Du, A. B. Kahng, S. Nath, and K. Samadi. 2016. BEOL stack-aware routability prediction from placement using data mining techniques. In International Conference on Computer Design (ICCD\u201916). 41\u201348."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2012.144"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3086952"},{"key":"e_1_2_1_10_1","unstructured":"G. Grewal and S. Areibi. 2018. Guelph FPGA CAD Group. Retrieved from http:\/\/fpga.socs.uoguelph.ca\/.  G. Grewal and S. Areibi. 2018. Guelph FPGA CAD Group. Retrieved from http:\/\/fpga.socs.uoguelph.ca\/."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3153803"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647928.757227"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2004.825865"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3122026"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2729349"},{"key":"e_1_2_1_16_1","first-page":"2","article-title":"Estimating routing congestion using probabilistic analysis","volume":"21","author":"Lou Jinan","year":"2002","unstructured":"Jinan Lou , Shashidhar Thakur , Shankar Krishnamoorthy , and Henry S. Sheng . 2002 . Estimating routing congestion using probabilistic analysis . IEEE Trans. Comput.-aided Des. ICs Syst. 21 , 2 (Jan. 2002). Jinan Lou, Shashidhar Thakur, Shankar Krishnamoorthy, and Henry S. Sheng. 2002. Estimating routing congestion using probabilistic analysis. IEEE Trans. Comput.-aided Des. ICs Syst. 21, 2 (Jan. 2002).","journal-title":"IEEE Trans. Comput.-aided Des. ICs Syst."},{"key":"e_1_2_1_17_1","volume-title":"IEEE International Conference on Field-programmable Logic and Applications. 427\u2013434","author":"Maarouf D.","unstructured":"D. Maarouf , A. Alhyari , Z. Abuowaimer , T. Martin , A. Gunter , G. Grewal , S. Areibi , and A. Vannelli . 2018. A machine-learning based congestion estimation for modern FPGAs . In IEEE International Conference on Field-programmable Logic and Applications. 427\u2013434 . D. Maarouf, A. Alhyari, Z. Abuowaimer, T. Martin, A. Gunter, G. Grewal, S. Areibi, and A. Vannelli. 2018. A machine-learning based congestion estimation for modern FPGAs. In IEEE International Conference on Field-programmable Logic and Applications. 427\u2013434."},{"key":"e_1_2_1_18_1","volume-title":"30th International Conference on Field-programmable Logic and Applications. 138\u2013144","author":"Marrouff D.","unstructured":"D. Marrouff , A. Shamli , T. Martin , G. Grewal , and S. Areibi . 2020. A deep-learning framework for predicting congestion during FPGA placement . In 30th International Conference on Field-programmable Logic and Applications. 138\u2013144 . D. Marrouff, A. Shamli, T. Martin, G. Grewal, and S. Areibi. 2020. A deep-learning framework for predicting congestion during FPGA placement. In 30th International Conference on Field-programmable Logic and Applications. 138\u2013144."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2980084"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3199700.3199828"},{"key":"e_1_2_1_22_1","volume-title":"IEEE International Conference on Computer Design. 97\u2013103","author":"Qi Z.","unstructured":"Z. Qi , Y. Cai , and Q. Zhou . 2014. Accurate prediction of detailed routing congestion using supervised data learning . In IEEE International Conference on Computer Design. 97\u2013103 . Z. Qi, Y. Cai, and Q. Zhou. 2014. Accurate prediction of detailed routing congestion using supervised data learning. In IEEE International Conference on Computer Design. 97\u2013103."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3130379.3130650"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2917130"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/258305.258322"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240765.3240843"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872334.2886419"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872334.2886419"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1231956.1231963"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317876"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"J. Zhao T. Liang S. Sinha and W. Zhang. 2019. Machine learning based routing congestion prediction in FPGA high-level synthesis. In Design Automation and Test in Europe (DATE\u201919). 1130\u20131135.  J. Zhao T. Liang S. Sinha and W. Zhang. 2019. Machine learning based routing congestion prediction in FPGA high-level synthesis. In Design Automation and Test in Europe (DATE\u201919). 1130\u20131135.","DOI":"10.23919\/DATE.2019.8714724"},{"key":"e_1_2_1_32_1","volume-title":"Asia Symposium on Quality Electronic Design. 119\u2013122","author":"Zhou Q.","unstructured":"Q. Zhou , X. Wang , Z. Qi , Z. Chen , Q. Zhou , and Y. Cai . 2015. An accurate detailed routing routability prediction model in placement . In Asia Symposium on Quality Electronic Design. 119\u2013122 . Q. Zhou, X. Wang, Z. Qi, Z. Chen, Q. Zhou, and Y. Cai. 2015. An accurate detailed routing routability prediction model in placement. In Asia Symposium on Quality Electronic Design. 119\u2013122."},{"key":"e_1_2_1_33_1","volume-title":"International Conference on Field-programmable Logic and Applications. 683\u2013686","author":"Zhuo Y.","unstructured":"Y. Zhuo , H. Li , and S. Mohanty . 2006. A congestion driven placement algorithm for FPGA synthesis . In International Conference on Field-programmable Logic and Applications. 683\u2013686 . Y. Zhuo, H. Li, and S. Mohanty. 2006. A congestion driven placement algorithm for FPGA synthesis. In International Conference on Field-programmable Logic and Applications. 683\u2013686."}],"container-title":["ACM Transactions on Reconfigurable Technology and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465373","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:12Z","timestamp":1750191432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,12]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9,30]]}},"alternative-id":["10.1145\/3465373"],"URL":"https:\/\/doi.org\/10.1145\/3465373","relation":{},"ISSN":["1936-7406","1936-7414"],"issn-type":[{"value":"1936-7406","type":"print"},{"value":"1936-7414","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,12]]},"assertion":[{"value":"2020-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}