{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:01:16Z","timestamp":1753887676533,"version":"3.41.2"},"reference-count":15,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"vor","delay-in-days":104,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2242021k30031"],"award-info":[{"award-number":["2242021k30031"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61977017","61772005"],"award-info":[{"award-number":["61977017","61772005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>As one of the most important routing problems in the complex network within a very\u2010large\u2010scale integration (VLSI) circuit, bus routing has become much more challenging when witnessing the advanced technology node enters the deep nanometer era because all bus bits need to be routed with the same routing topology in the context. In particular, the nonuniform routing track configuration and obstacles bring the largest difficulty for maintaining the same topology for all bus bits. In this paper, we first present a track handling technique to unify the nonuniform routing track configuration with obstacles. Then, we formulate the topology\u2010aware single bus routing as an unsplittable flow problem (UFP), which is integrated into a negotiation\u2010based global routing to determine the desired routing regions for each bus. A topology\u2010aware track assignment is also presented to allocate the tracks to each segment of buses under the guidance of the global routing result. Finally, a detailed routing scheme is proposed to connect the segments of each bus. We evaluate our routing result with the benchmark suite of the 2018 CAD Contest. Compared with the top\u20103 state\u2010of\u2010the\u2010art methods, experimental results show that our proposed algorithm achieves the best overall score regarding specified time limitations.<\/jats:p>","DOI":"10.1155\/2021\/8843271","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T21:07:03Z","timestamp":1618520823000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Topology\u2010Aware Bus Routing in Complex Networks of Very\u2010Large\u2010Scale Integration with Nonuniform Track Configurations and Obstacles"],"prefix":"10.1155","volume":"2021","author":[{"given":"Ziran","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianli","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,4,15]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/8170632"},{"key":"e_1_2_9_2_2","doi-asserted-by":"crossref","unstructured":"TianY.andWatanabeT. Improved delay-matching bus routing by using multi-layers Proceedings of the International Conference on Electronics Packaging and iMAPS All Asia Conference (ICEP-IAAC) April 2015 Kyoto Japan 708\u2013713 https:\/\/doi.org\/10.1109\/ICEP-IAAC.2015.7111103 2-s2.0-84936096470.","DOI":"10.1109\/ICEP-IAAC.2015.7111103"},{"key":"e_1_2_9_3_2","doi-asserted-by":"crossref","unstructured":"YanT.andWongM. D. F. Bsg-route: a length-matching router for general topology Proceedings of IEEE\/ACM International Conference on Computer-Aided Design November 2008 San Jose CA USA 499\u2013505 https:\/\/doi.org\/10.1109\/ICCAD.2008.4681621 2-s2.0-57849149952.","DOI":"10.1109\/ICCAD.2008.4681621"},{"key":"e_1_2_9_4_2","doi-asserted-by":"crossref","unstructured":"ZhangR. PanT. ZhuL. andWatanabeT. A length matching routing method for disordered pins in pcb design Proceedings of the IEEE\/ACM Asia and South Pacific Design Automation Conference January 2015 Chiba Japan https:\/\/doi.org\/10.1109\/ASPDAC.2015.7059038 2-s2.0-84926469169.","DOI":"10.1109\/ASPDAC.2015.7059038"},{"key":"e_1_2_9_5_2","unstructured":"LiaoA. ChangH.-Y. ChiO. andWangJ. 2018 ICCAD 2018 CAD contest: obstacle-aware on-track bus routing http:\/\/iccad-contest.org\/2018\/problems.html."},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420013481"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1172-z"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2010.2061590"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2012.2235124"},{"key":"e_1_2_9_10_2","doi-asserted-by":"crossref","unstructured":"WongM.-P. LiuW.-H. andWangT.-C. Negotiation-based track assignment considering local nets Proceedings of the IEEE\/ACM Asia and South Pacific Design Automation Conference January 2016 Macao China https:\/\/doi.org\/10.1109\/ASPDAC.2016.7428041 2-s2.0-84996922169.","DOI":"10.1109\/ASPDAC.2016.7428041"},{"key":"e_1_2_9_11_2","doi-asserted-by":"crossref","unstructured":"SunF.-K. ChenH. ChenC.-Y. HsuC.-H. andChangY.-W. A multithreaded initial detailed routing algorithm considering global routing guides Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design November 2018 San Diego CA USA 81:1\u201381:7 https:\/\/doi.org\/10.1145\/3240765.3240777 2-s2.0-85058141786.","DOI":"10.1145\/3240765.3240777"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2008.927733"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2002.1013891"},{"key":"e_1_2_9_14_2","doi-asserted-by":"crossref","unstructured":"XuY. ZhangY. andChuC. Fastroute 4.0: global router with efficient via minimization Proceedings of the IEEE\/ACM Asia and South Pacific Design Automation Conference January 2009 Yokohama Japan https:\/\/doi.org\/10.1109\/ASPDAC.2009.4796542 2-s2.0-64549091868.","DOI":"10.1109\/ASPDAC.2009.4796542"},{"key":"e_1_2_9_15_2","doi-asserted-by":"crossref","unstructured":"HetzelA. A sequential detailed router for huge grid graphs Proceedings of the Conference on Design Automation and Test in Europe February 1998 Paris France https:\/\/doi.org\/10.1109\/DATE.1998.655877 2-s2.0-84893735100.","DOI":"10.1109\/DATE.1998.655877"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/8843271.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/8843271.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/8843271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:33:16Z","timestamp":1723242796000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/8843271"}},"subtitle":[],"editor":[{"given":"Shi","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/8843271"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8843271","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-09-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8843271"}}