{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T06:37:31Z","timestamp":1773470251562,"version":"3.50.1"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T00:00:00Z","timestamp":1525824000000},"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,7,31]]},"abstract":"<jats:p>Modern field-programmable gate array (FPGA) devices contain complex clock architectures on top of configurable logics. Unlike application specific integrated circuits (ASICs), the physical structure of clock networks in an FPGA is pre-manufactured and cannot be adjusted to different applications. Furthermore, clock routing resources are typically limited for high-utilization designs. Consequently, clock architectures impose extra clock constraints and further complicate physical implementation tasks such as placement. Traditional ASIC placement techniques only optimize conventional design metrics such as wirelength, routability, power, and timing without clock legality consideration. It is imperative to have new techniques to honor clock constraints during placement for FPGAs. In this article, we propose a high-performance FPGA placement engine, UTPlaceF 2.0, that optimizes wirelength and routability while honoring complex clock constraints. Our proposed approaches consist of an iterative minimum-cost-flow-based cell assignment as well as a clock-aware packing for producing clock-legal yet high-quality placement solutions. UTPlaceF 2.0 won first place in the ISPD\u201917 clock-aware FPGA placement contest organized by Xilinx, outperforming the second- and the third-place winners by 4.0% and 10.0%, respectively, in routed wirelength with competitive runtime, on a set of industry benchmarks.<\/jats:p>","DOI":"10.1145\/3174849","type":"journal-article","created":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T12:37:56Z","timestamp":1525869476000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["UTPlaceF 2.0"],"prefix":"10.1145","volume":"23","author":[{"given":"Wuxi","family":"Li","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, 2501 Speedway, EER, Austin, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yibo","family":"Lin","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, 2501 Speedway, EER, Austin, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Li","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, 2501 Speedway, EER, Austin, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shounak","family":"Dhar","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, 2501 Speedway, EER, Austin, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David Z.","family":"Pan","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, 2501 Speedway, EER, Austin, TX"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Orlin","author":"Ahuja Ravindra K.","year":"1993"},{"key":"e_1_2_1_2_1","volume-title":"Special Functions of Mathematics for Engineers","author":"Andrews Larry C."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647924.738755"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2691365.2691497"},{"key":"e_1_2_1_5_1","volume-title":"IEEE International Conference on Field Programmable Logic and Applications (FPL\u201912)","author":"Gort Marcel"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391732.1391733"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2729349"},{"key":"e_1_2_1_8_1","volume-title":"IEEE\/ACM International Conference on Computer-Aided Design (ICCAD\u201917)","author":"Li Wuxi"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2561828.2561900"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488746"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/296399.296426"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.870079"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2980085"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2980084"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024908"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/605440.605448"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062279"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233643"},{"key":"e_1_2_1_19_1","volume-title":"Retrieved on","author":"Xilinx Inc.","year":"2017"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2011.02.001"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872334.2886419"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3036669.3038241"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3174849","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3174849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:33Z","timestamp":1750212693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3174849"}},"subtitle":["A High-Performance Clock-Aware FPGA Placement Engine"],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7,31]]}},"alternative-id":["10.1145\/3174849"],"URL":"https:\/\/doi.org\/10.1145\/3174849","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,9]]},"assertion":[{"value":"2017-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}