{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T23:15:32Z","timestamp":1775862932408,"version":"3.50.1"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2018,9,30]],"date-time":"2018-09-30T00:00:00Z","timestamp":1538265600000},"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. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2018,9,30]]},"abstract":"<jats:p>Optimizing for routability during FPGA placement is becoming increasingly important, as failure to spread and resolve congestion hotspots throughout the chip, especially in the case of large designs, may result in placements that either cannot be routed or that require the router to work excessively hard to obtain success. In this article, we introduce a new, analytic routability-aware placement algorithm for Xilinx UltraScale FPGA architectures. The proposed algorithm, called GPlace3.0, seeks to optimize both wirelength and routability. Our work contains several unique features including a novel window-based procedure for satisfying legality constraints in lieu of packing, an accurate congestion estimation method based on modifications to the pathfinder global router, and a novel detailed placement algorithm that optimizes both wirelength and external pin count. Experimental results show that compared to the top three winners at the recent ISPD\u201916 FPGA placement contest, GPlace3.0 is able to achieve (on average) a 7.53%, 15.15%, and 33.50% reduction in routed wirelength, respectively, while requiring less overall runtime. As well, an additional 360 benchmarks were provided directly from Xilinx Inc. These benchmarks were used to compare GPlace3.0 to the most recently improved versions of the first- and second-place contest winners. Subsequent experimental results show that GPlace3.0 is able to outperform the improved placers in a variety of areas including number of best solutions found, fewest number of benchmarks that cannot be routed, runtime required to perform placement, and runtime required to perform routing.<\/jats:p>","DOI":"10.1145\/3233244","type":"journal-article","created":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T12:35:08Z","timestamp":1539347708000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["GPlace3.0"],"prefix":"10.1145","volume":"23","author":[{"given":"Ziad","family":"Abuowaimer","sequence":"first","affiliation":[{"name":"University of Guelph, Canada"}]},{"given":"Dani","family":"Maarouf","sequence":"additional","affiliation":[{"name":"University of Guelph, Canada"}]},{"given":"Timothy","family":"Martin","sequence":"additional","affiliation":[{"name":"University of Guelph, Canada"}]},{"given":"Jeremy","family":"Foxcroft","sequence":"additional","affiliation":[{"name":"University of Guelph, Canada"}]},{"given":"Gary","family":"Gr\u00e9wal","sequence":"additional","affiliation":[{"name":"University of Guelph, Canada"}]},{"given":"Shawki","family":"Areibi","sequence":"additional","affiliation":[{"name":"University of Guelph, Canada"}]},{"given":"Anthony","family":"Vannelli","sequence":"additional","affiliation":[{"name":"University of Guelph, Canada"}]}],"member":"320","published-online":{"date-parts":[[2018,10,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"VPR: A new packing, placement and routing tool for FPGA research. In Field-Programmable Logic and Applications","author":"Betz Vaughn","year":"1997","unstructured":"Vaughn Betz and Jonathan Rose . 1997 . VPR: A new packing, placement and routing tool for FPGA research. In Field-Programmable Logic and Applications . Springer , 213--222. Vaughn Betz and Jonathan Rose. 1997. VPR: A new packing, placement and routing tool for FPGA research. In Field-Programmable Logic and Applications. Springer, 213--222."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1723112.1723140"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126604001222"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744903"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 2014 IEEE\/ACM International Conference on Computer-Aided Design. 647--654","author":"Chen Yu-Chen","unstructured":"Yu-Chen Chen , Sheng-Yen Chen , and Yao-Wen Chang . n.d. Efficient and effective packing and analytical placement for large-scale heterogeneous FPGAs . In Proceedings of the 2014 IEEE\/ACM International Conference on Computer-Aided Design. 647--654 . Yu-Chen Chen, Sheng-Yen Chen, and Yao-Wen Chang. n.d. Efficient and effective packing and analytical placement for large-scale heterogeneous FPGAs. In Proceedings of the 2014 IEEE\/ACM International Conference on Computer-Aided Design. 647--654."},{"key":"e_1_2_1_6_1","unstructured":"GNL. n.d. Netlist-Generator Tool. Retrieved 1999 from http:\/\/users.elis.ugent.be\/dstrooba\/gnl\/.  GNL. n.d. Netlist-Generator Tool. Retrieved 1999 from http:\/\/users.elis.ugent.be\/dstrooba\/gnl\/."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147033"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2012.6339278"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 24th Reconfigurable Architectures Workshop","author":"Grewal G.","unstructured":"G. Grewal , S. Areibi , M. Westrik , Z. Abuowaimer , and B. Zhao . 2017. Automatic flow selection and quality-of-result estimation for FPGA placement . In Proceedings of the 24th Reconfigurable Architectures Workshop . Orlando, Florida, 115--123. G. Grewal, S. Areibi, M. Westrik, Z. Abuowaimer, and B. Zhao. 2017. Automatic flow selection and quality-of-result estimation for FPGA placement. In Proceedings of the 24th Reconfigurable Architectures Workshop. Orlando, Florida, 115--123."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/370155.370560"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735035"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2729349"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2980083"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2235124"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/201310.201328"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/608362"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2980085"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2980084"},{"key":"e_1_2_1_19_1","volume-title":"Johannes","author":"Spindler Peter","year":"2007","unstructured":"Peter Spindler and Frank M . Johannes . 2007 . Kraftwerk : A fast and robust quadratic placer using an exact linear net model. In Modern Circuit Placement. Springer , 59--93. Peter Spindler and Frank M. Johannes. 2007. Kraftwerk: A fast and robust quadratic placer using an exact linear net model. In Modern Circuit Placement. Springer, 59--93."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/647927.739548"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233643"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the ASICON\u201909 Conference. 742--746","author":"Xie D.","unstructured":"D. Xie , J. Xu , and J. Lai . 2009. A new FPGA placement algorithm for heterogeneous resources . In Proceedings of the ASICON\u201909 Conference. 742--746 . D. Xie, J. Xu, and J. Lai. 2009. A new FPGA placement algorithm for heterogeneous resources. In Proceedings of the ASICON\u201909 Conference. 742--746."},{"key":"e_1_2_1_23_1","volume-title":"ISPD 2016 Routability-Driven FPGA Placement Contest. Retrieved","year":"2017","unstructured":"Xilinx. n.d. ISPD 2016 Routability-Driven FPGA Placement Contest. Retrieved March 17, 2017 from http:\/\/www.ispd.cc\/contests\/16\/ispd2016_contest.html. Xilinx. n.d. ISPD 2016 Routability-Driven FPGA Placement Contest. Retrieved March 17, 2017 from http:\/\/www.ispd.cc\/contests\/16\/ispd2016_contest.html."},{"key":"e_1_2_1_24_1","unstructured":"Xilinx. {n. d.}. UltraScale Architecture Configurable Logic Block User Guide. http:\/\/www.xilinx.com\/support\/documentation\/user_guides\/ug574-ultrascale-clb.pdf.  Xilinx. {n. d.}. UltraScale Architecture Configurable Logic Block User Guide. http:\/\/www.xilinx.com\/support\/documentation\/user_guides\/ug574-ultrascale-clb.pdf."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1975015.1975357"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the International Conference on Field Programmable Logic and Applications. IEEE, 555--558","author":"Xu Yonghong","unstructured":"Yonghong Xu and Mohammed A. S. Khalid . 2005. QPF: Efficient quadratic placement for FPGAs . In Proceedings of the International Conference on Field Programmable Logic and Applications. IEEE, 555--558 . Yonghong Xu and Mohammed A. S. Khalid. 2005. QPF: Efficient quadratic placement for FPGAs. In Proceedings of the International Conference on Field Programmable Logic and Applications. IEEE, 555--558."},{"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\/1231956.1231963"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3233244","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3233244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:12Z","timestamp":1750212792000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3233244"}},"subtitle":["Routability-Driven Analytic Placer for UltraScale FPGA Architectures"],"short-title":[],"issued":{"date-parts":[[2018,9,30]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9,30]]}},"alternative-id":["10.1145\/3233244"],"URL":"https:\/\/doi.org\/10.1145\/3233244","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,30]]},"assertion":[{"value":"2017-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}