{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:57:26Z","timestamp":1763643446907,"version":"3.41.0"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T00:00:00Z","timestamp":1660089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61877010 and 11501114"],"award-info":[{"award-number":["61877010 and 11501114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"State Key Laboratory of Computer Architecture","award":["CARCHB202014"],"award-info":[{"award-number":["CARCHB202014"]}]},{"name":"Fujian Natural Science Funds","award":["2019J01243"],"award-info":[{"award-number":["2019J01243"]}]},{"DOI":"10.13039\/501100008859","name":"Fuzhou University","doi-asserted-by":"crossref","award":["GXRC-20060"],"award-info":[{"award-number":["GXRC-20060"]}],"id":[{"id":"10.13039\/501100008859","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>The new 7-nm Artificial Intelligence (AI) chip is an important milestone recently announced by the IBM research team, with a very important optimization goal of performance. This chip technology can be extended to various business scenarios in the Internet of Things. As the basic model for very large scale integration routing, the Steiner minimal tree can be used in various practical problems, such as wirelength optimization and timing closure. Further considering the X-architecture and the routing resources within obstacles, an effective performance-driven X-architecture routing algorithm for AI chip design in smart manufacturing is proposed to improve the delay performance of the chip. First, a special particle swarm optimization algorithm is presented to solve the discrete length-restricted X-architecture Steiner minimum tree problem in combination with genetic operations, and a particle encoding scheme is presented to encode each particle into an initial routing tree. Second, two lookup tables based on pins and obstacles are established to provide a fast information query for the whole algorithm flow. Third, a strategy of candidate point selection is designed to make the particles satisfy the constraints. Finally, a refinement strategy is implemented to further improve the quality of the final routing tree. Compared with other state-of-the-art algorithms, the proposed algorithm achieves a better total wirelength, which is an important index of performance, thus better satisfying the demand for delay performance of AI chip design in smart manufacturing.<\/jats:p>","DOI":"10.1145\/3519422","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T06:19:15Z","timestamp":1648189155000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Performance-Driven X-Architecture Routing Algorithm\u00a0for Artificial Intelligence Chip Design in Smart Manufacturing"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3099-4371","authenticated-orcid":false,"given":"Genggeng","family":"Liu","sequence":"first","affiliation":[{"name":"Fuzhou University, Fuzhou, Fujian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhan","family":"Zhu","sequence":"additional","affiliation":[{"name":"Fuzhou University, Fuzhou, Fujian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saijuan","family":"Xu","sequence":"additional","affiliation":[{"name":"Fujian Business University, Fuzhou, Fujian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Tang","sequence":"additional","affiliation":[{"name":"Fuzhou University, Fuzhou, Fujian, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeh-Cheng","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,10]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2096571"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2009.4937856"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.331412"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2971574"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2006085"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/764808.764810"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2902604"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/mc.2020.3034951"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2916338"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2475174"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2756874"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2560519.2560529"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065734"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/1576594.1576601"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2098930"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654220"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024762"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429411"},{"issue":"3","key":"e_1_3_1_22_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2856033","article-title":"FH-OAOS: A fast four-step heuristic for obstacle-avoiding octilinear Steiner tree construction","volume":"21","author":"Huang Xing","year":"2016","unstructured":"Xing Huang, Wenzhong Guo, Genggeng Liu, and Guolong Chen. 2016. FH-OAOS: A fast four-step heuristic for obstacle-avoiding octilinear Steiner tree construction. ACM Transactions on Design Automation of Electronic Systems 21, 3 (2016), 1\u201331.","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-0850-4"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/2699862"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.896291"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1119772.1119955"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/589411.589424"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/SAMI48414.2020.9108766"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060448"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107215"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-04165-2"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1329-2"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2021.09.002"},{"issue":"5","key":"e_1_3_1_34_2","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TCYB.2014.2342713","article-title":"Multilayer obstacle-avoiding X-architecture Steiner minimal tree construction based on particle swarm optimization","volume":"45","author":"Liu Genggeng","year":"2014","unstructured":"Genggeng Liu, Xing Huang, Wenzhong Guo, Yuzhen Niu, and Guolong Chen. 2014. Multilayer obstacle-avoiding X-architecture Steiner minimal tree construction based on particle swarm optimization. IEEE Transactions on Cybernetics 45, 5 (2014), 1003\u20131016.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.473"},{"key":"e_1_3_1_36_2","article-title":"Timing-aware layer assignment for advanced process technologies considering via pillars","author":"Liu Genggeng","year":"2021","unstructured":"Genggeng Liu, Xinghai Zhang, Wenzhong Guo, Xing Huang, Wen-Hao Liu, Kai-Yuan Chao, and Ting-Chi Wang. 2021. Timing-aware layer assignment for advanced process technologies considering via pillars. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. Early access, July 26, 2021.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems."},{"key":"e_1_3_1_37_2","first-page":"1","article-title":"Efficient VLSI routing algorithm employing novel discrete PSO and multi-stage transformation","author":"Liu Genggeng","year":"2020","unstructured":"Genggeng Liu, Weida Zhu, Saijuan Xu, Zhen Zhuang, Yeh-Cheng Chen, and Guolong Chen. 2020. Efficient VLSI routing algorithm employing novel discrete PSO and multi-stage transformation. Journal of Ambient Intelligence and Humanized Computing 2020 (2020), 1\u201316.","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.108114"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299874.3318026"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2006098"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2869847"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2017.4541037"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90066-X"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.35848\/1347-4065\/ab839f"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45078-8_19"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1204836"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-020-03107-0"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2986138"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/505348.505355"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.368006"},{"key":"e_1_3_1_51_2","doi-asserted-by":"crossref","first-page":"e6385","DOI":"10.1002\/cpe.6385","article-title":"A feature-based approach for guiding the selection of Internet of Things cybersecurity standards using text mining","author":"Schaaf Koen van der","year":"2021","unstructured":"Koen van der Schaaf, Bedir Tekinerdogan, and Cagatay Catal. 2021. A feature-based approach for guiding the selection of Internet of Things cybersecurity standards using text mining. Concurrency and Computation: Practice and Experience 33, 21 (2021), e6385.","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/CESYS.2016.7889854"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3196040"},{"key":"e_1_3_1_54_2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-1-4757-3171-2_6","volume-title":"Advances in Steiner Trees","author":"Warme David M.","year":"2000","unstructured":"David M. Warme, Pawel Winter, and Martin Zachariasen. 2000. Exact algorithms for plane Steiner tree problems: A computational study. In Advances in Steiner Trees. Springer, 81\u2013116."},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676904"},{"key":"e_1_3_1_56_2","first-page":"7133","article-title":"A high-quality global routing algorithm based on hybrid topology optimization and heuristic search for data processing in MEC","author":"Xu Saijuan","year":"2021","unstructured":"Saijuan Xu, Ling Wei, Genggeng Liu, Yeh-Cheng Chen, and Guolong Chen. 2021. A high-quality global routing algorithm based on hybrid topology optimization and heuristic search for data processing in MEC. Journal of Supercomputing 78 (2021), 7133\u20137157.","journal-title":"Journal of Supercomputing"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/1344418.1344422"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2821175"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2016.06.001"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2817020"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429410"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/640000.640034"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.850862"}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519422","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:38Z","timestamp":1750268978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,10]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1145\/3519422"],"URL":"https:\/\/doi.org\/10.1145\/3519422","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"type":"print","value":"2158-656X"},{"type":"electronic","value":"2158-6578"}],"subject":[],"published":{"date-parts":[[2022,8,10]]},"assertion":[{"value":"2021-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}