{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:23:59Z","timestamp":1774628639256,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T00:00:00Z","timestamp":1676160000000},"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":[],"published-print":{"date-parts":[[2023,2,12]]},"DOI":"10.1145\/3543622.3573192","type":"proceedings-article","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:15:13Z","timestamp":1676070913000},"page":"99-109","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Regularity Matters: Designing Practical FPGA Switch-Blocks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6831-1740","authenticated-orcid":false,"given":"Stefan","family":"Nikolic","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6142-7345","authenticated-orcid":false,"given":"Paolo","family":"Ienne","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"11","volume-title":"Virtual Event","author":"Petersen M. B.","year":"2021","unstructured":"M. B. Petersen, S. Nikolic, and M. Stojilovi?, ?NetCracker: A peek into the routing architecture of Xilinx 7-Series FPGAs,\" in Proceedings of the 2021 ACM\/SIGDA International Symposium on Field Programmable Gate Arrays, Virtual Event, Feb. 2021, pp. 11--22."},{"key":"e_1_3_2_1_2_1","first-page":"225","volume-title":"Dresden","author":"Ienne S.","year":"2021","unstructured":"S. Nikoli? and P. Ienne, ?Turning PathFinder upside-down: Exploring FPGA switch-blocks by negotiating switch presence,\" in Proceedings of the 31st International Conference on Field-Programmable Logic and Applications, Dresden, Aug. 2021, pp. 225--33."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061530"},{"key":"e_1_3_2_1_4_1","first-page":"1","volume-title":"Auckland","author":"Qian J.","year":"2021","unstructured":"J. Qian, Y. Shen, K. Shi, H. Zhou, and L. Wang, \"General routing architecture modelling and exploration for modern FPGAs,\" in Proceedings of the 2021 International Conference on Field-Programmable Technology, Auckland, Dec. 2021, pp. 1--9."},{"key":"e_1_3_2_1_5_1","first-page":"155","volume-title":"Calif.","author":"Lemieux G.","year":"2000","unstructured":"G. Lemieux, P. Leventis, and D. Lewis, \"Generating highly-routable sparse crossbars for PLDs,\" in Proceedings of the 2000 ACM\/SIGDA Eighth International Symposium on Field Programmable Gate Arrays, Monterey, Calif., Feb. 2000, pp. 155--64."},{"key":"e_1_3_2_1_6_1","first-page":"12","volume-title":"Calif.","author":"Lewis D.","year":"2003","unstructured":"D. Lewis, V. Betz, D. Jefferson, A. Lee, C. Lane, P. Leventis, S. Marquardt, C. McClintock, B. Pedersen, G. Powell, S. Reddy, C. Wysocki, R. Cliff, and J. Rose, \"The Stratix routing and logic architecture,\" in Proceedings of the 2003 ACM\/SIGDA Eleventh International Symposium on Field Programmable Gate Arrays, Monterey, Calif., Feb. 2003, pp. 12--20."},{"key":"e_1_3_2_1_7_1","first-page":"147","volume-title":"Calif.","author":"Lewis D.","year":"2013","unstructured":"D. Lewis, D. Cashman, M. Chan, J. Chromczak, G. Lai, A. Lee, T. Vanderhoek, and H. Yu, \"Architectural enhancements in Stratix V?,\" in Proceedings of the ACM\/SIGDA International Symposium on Field Programmable Gate Arrays, Monterey, Calif., Feb. 2013, pp. 147--56."},{"key":"e_1_3_2_1_8_1","first-page":"140","volume-title":"Calif.","author":"Chromczak J.","year":"2020","unstructured":"J. Chromczak, M. Wheeler, C. Chiasson, D. How, M. Langhammer, T. Vanderhoek, G. Zgheib, and I. Ganusov, \"Architectural enhancements in Intel\u00ae Agilex? FPGAs,\" in Proceedings of the 2020 ACM\/SIGDA International Symposium on Field- Programmable Gate Arrays, Seaside, Calif., Feb. 2020, p. 140--49."},{"key":"e_1_3_2_1_9_1","first-page":"173","article-title":"Timing-driven PathFinder pathology and remediation: Quantifying and reducing delay noise in VPR-PathFinder,\" in Proceedings of the ACM\/SIGDA 19th International Symposium on Field Programmable Gate Arrays, Monterey","author":"Rubin R.","year":"2011","unstructured":"R. Rubin and A. DeHon, \"Timing-driven PathFinder pathology and remediation: Quantifying and reducing delay noise in VPR-PathFinder,\" in Proceedings of the ACM\/SIGDA 19th International Symposium on Field Programmable Gate Arrays, Monterey, Calif., Feb. 2011, pp. 173--76.","journal-title":"Calif."},{"key":"e_1_3_2_1_10_1","first-page":"24","volume-title":"Virtual Event","author":"Zha Y.","year":"2022","unstructured":"Y. Zha and J. Li, \"Revisiting PathFinder routing algorithm,\" in Proceedings of the 2022 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, Virtual Event, 2022, pp. 24--34."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3388617"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.853692"},{"key":"e_1_3_2_1_13_1","unstructured":"C. Wolf and M. Lasser \"Project icestorm \" http:\/\/bygone.clairexen.net\/icestorm\/."},{"key":"e_1_3_2_1_14_1","first-page":"995","article-title":"Six-input multiplexer with two gate levels and three memory cells","volume":"5","author":"Young S. P.","year":"1998","unstructured":"S. P. Young, \"Six-input multiplexer with two gate levels and three memory cells,\" US Patent 5 744 995, 1998.","journal-title":"US Patent"},{"key":"e_1_3_2_1_15_1","volume-title":"Model Building in Mathematical Programming","author":"Williams H. P.","year":"2013","unstructured":"H. P. Williams, Model Building in Mathematical Programming, 5th ed. Wiley, 2013.","edition":"5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9260(99)00002-4"},{"key":"e_1_3_2_1_17_1","first-page":"34","volume-title":"Virtual Event","author":"S.","year":"2021","unstructured":"S. Nikoli\", F. Catthoor, Z. T?kei, and P. Ienne, \"Global is the new local: FPGA architecture at 5nm and beyond,\" in Proceedings of the 2021 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, Virtual Event, Feb. 2021, pp. 34--44."},{"key":"e_1_3_2_1_18_1","first-page":"208","volume-title":"Helsinki","author":"Mihal A.","year":"2013","unstructured":"A. Mihal and S. Teig, \"A constraint satisfaction approach for programmable logic detailed placement,\" in Proceedings of the 16th International Conference on Theory and Applications of Satisfiability Testing, Helsinki, Jul. 2013, pp. 208--23."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/553523"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.586"},{"issue":"2","key":"e_1_3_2_1_21_1","first-page":"79","article-title":"A linear formulation with O(","volume":"3","author":"Gueye S.","year":"2015","unstructured":"S. Gueye and P. Michelon, \"A linear formulation with O(\"\"2 ) variables for quadratic assignment problems with manhattan distance matrices,\" EURO Journal on Computational Optimization, vol. 3, no. 2, pp. 79--110, 2015.","journal-title":"\"2 ) variables for quadratic assignment problems with manhattan distance matrices,\" EURO Journal on Computational Optimization"},{"key":"e_1_3_2_1_22_1","first-page":"203","volume-title":"Calif.","author":"Marquardt A.","year":"2000","unstructured":"A. Marquardt, V. Betz, and J. Rose, \"Timing-driven placement for FPGAs,\" in Proceedings of the ACM\/SIGDA International Symposium on Field Programmable Gate Arrays, Monterey, Calif., Feb. 2000, pp. 203--13."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.75006"},{"key":"e_1_3_2_1_24_1","volume-title":"Computational Complexity","author":"Papadimitriou C.","year":"1994","unstructured":"C. Papadimitriou, Computational Complexity. Addison-Wesley, 1994."}],"event":{"name":"FPGA '23: The 2023 ACM\/SIGDA International Symposium on Field Programmable Gate Arrays","location":"Monterey CA USA","acronym":"FPGA '23","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2023 ACM\/SIGDA International Symposium on Field Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543622.3573192","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543622.3573192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:48Z","timestamp":1750186848000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543622.3573192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,12]]},"references-count":24,"alternative-id":["10.1145\/3543622.3573192","10.1145\/3543622"],"URL":"https:\/\/doi.org\/10.1145\/3543622.3573192","relation":{},"subject":[],"published":{"date-parts":[[2023,2,12]]},"assertion":[{"value":"2023-02-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}