{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:01Z","timestamp":1750309501042,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"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":[[2024,6,23]]},"DOI":"10.1145\/3649329.3655900","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Top-Level Routing for Multiply-Instantiated Blocks with Topology Hashing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7054-384X","authenticated-orcid":false,"given":"Jiarui","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science, Peking University, Beijing, China"},{"name":"School of Integrated Circuits, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7958-8485","authenticated-orcid":false,"given":"Xun","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Integrated Circuits, Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0977-2774","authenticated-orcid":false,"given":"Yibo","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Integrated Circuits, Peking University, Beijing, China"},{"name":"Beijing Advanced Innovation Center for Integrated Circuits, Beijing, China"},{"name":"Institute of Electronic Design Automation, Peking University, Wuxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1931","article-title":"NTHU-Route 2.0: A Robust Global Router for Modern Designs","volume":"29","author":"Chang Yen-Jung","year":"2010","unstructured":"Yen-Jung Chang et al. 2010. NTHU-Route 2.0: A Robust Global Router for Modern Designs. IEEE TCAD 29, 12 (2010), 1931--1944.","journal-title":"IEEE TCAD"},{"volume-title":"Proc. ICCAD. 569--576","author":"Gengjie","unstructured":"Gengjie Chen et al. 2017. SALT: Provably good routing topology by a novel steiner shallow-light tree algorithm. In Proc. ICCAD. 569--576.","key":"e_1_3_2_1_2_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/ICCAD.2004.1382665"},{"key":"e_1_3_2_1_4_1","volume-title":"A note on two problems in connexion with graphs. Numerische mathematik 1, 1","author":"Dijkstra Edsger W","year":"1959","unstructured":"Edsger W Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1, 1 (1959), 269--271."},{"doi-asserted-by":"crossref","unstructured":"Michael Gester et al. 2013. BonnRoute: Algorithms and Data Structures for Fast and Good VLSI Routing. ACM TODAES 18 2 Article 32 (April 2013) 24 pages.","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2442087.2442103"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1137\/0114025"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_8_1","volume-title":"Kahng et al","author":"Andrew","year":"2018","unstructured":"Andrew B. Kahng et al. 2018. TritonRoute: an initial detailed router for advanced VLSI technologies. In Proc. ICCAD. ACM, 1--8."},{"key":"e_1_3_2_1_9_1","first-page":"547","article-title":"TritonRoute","volume":"40","author":"Kahng Andrew B.","year":"2021","unstructured":"Andrew B. Kahng et al. 2021. TritonRoute: The Open-Source Detailed Router. IEEE TCAD 40, 3 (2021), 547--559.","journal-title":"The Open-Source Detailed Router. IEEE TCAD"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/TEC.1961.5219222"},{"volume-title":"Proc. ICCAD. 1--7.","author":"Haocheng","unstructured":"Haocheng Li et al. 2019. Dr. CU 2.0: A Scalable Detailed Routing Framework with Correct-by-Construction Design Rule Satisfaction. In Proc. ICCAD. 1--7.","key":"e_1_3_2_1_11_1"},{"unstructured":"Bohai Liu et al. 2022. Multiply instantiated block-aware top-level router. https:\/\/eda.icisc.cn\/en\/file\/cacheFile\/ee280e8ccf5647ff987ea0e9fc6d9357.pdf.","key":"e_1_3_2_1_12_1"},{"volume-title":"Proc. DAC. 1--6.","author":"Jinwei","unstructured":"Jinwei Liu et al. 2020. CUGR: Detailed-Routability-Driven 3D Global Routing with Probabilistic Resource Model. In Proc. DAC. 1--6.","key":"e_1_3_2_1_13_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/TCAD.2012.2235124"},{"volume-title":"Proc. FPGA. 111--117","author":"McMurchie L.","unstructured":"L. McMurchie and C. Ebeling. 1995. PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs. In Proc. FPGA. 111--117.","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","first-page":"1066","article-title":"High-Performance Routing at the Nanometer Scale","volume":"27","author":"Roy Jarrod A.","year":"2008","unstructured":"Jarrod A. Roy and Igor L. Markov. 2008. High-Performance Routing at the Nanometer Scale. IEEE TCAD 27, 6 (2008), 1066--1077.","journal-title":"IEEE TCAD"},{"unstructured":"Synopsys. 2023. Smarter System-on-Chip Signoff with Multiply Instantiated Module Support. https:\/\/www.synopsys.com\/implementation-and-signoff\/resources\/videos\/smarter-soc-signoff.html.","key":"e_1_3_2_1_17_1"},{"volume-title":"Proc. ASPDAC (ASPDAC '23)","author":"Jiarui","unstructured":"Jiarui Wang et al. 2023. A Robust FPGA Router with Concurrent Intra-CLB Rerouting. In Proc. ASPDAC (ASPDAC '23). Association for Computing Machinery, New York, NY, USA, 529--534.","key":"e_1_3_2_1_18_1"},{"volume-title":"Proc. ISEDA. 274--279","author":"Hang","unstructured":"Hang Yang et al. 2023. Multi-instantiated Block Top-layer Routing Technique Based on Steiner Tree Algorithm. In Proc. ISEDA. 274--279.","key":"e_1_3_2_1_19_1"},{"volume-title":"Proc. ICET. 629--634","author":"Hang","unstructured":"Hang Yang et al. 2023. Multi-Instantiation Top-Level Routing Technique Based on Decision Negotiation Algorithm. In Proc. ICET. 629--634.","key":"e_1_3_2_1_20_1"}],"event":{"sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"acronym":"DAC '24","name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA"},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655900","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3655900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:48Z","timestamp":1750295868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":20,"alternative-id":["10.1145\/3649329.3655900","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3655900","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}