乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:40:08Z","timestamp":1732653608170,"version":"3.28.2"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1016\/j.vlsi.2024.102263","type":"journal-article","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T15:34:49Z","timestamp":1723908889000},"page":"102263","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A fast and high-performance global router with enhanced congestion control"],"prefix":"10.1016","volume":"99","author":[{"given":"Xiqiong","family":"Bai","sequence":"first","affiliation":[]},{"given":"Yilu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhifeng","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Min","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Zhijie","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Ziran","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Jianli","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.vlsi.2024.102263_b1","first-page":"1","article-title":"CRP 2.0: A fast and robust cooperation between routing and placement in advanced technology nodes","volume":"28","author":"Aghaeekiasaraee","year":"2023","journal-title":"IEEE Trans. Circuits Syst. II"},{"issue":"4","key":"10.1016\/j.vlsi.2024.102263_b2","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1109\/TCAD.2021.3079268","article-title":"TritonRoute-WXL: the open-source router with integrated DRC engine","volume":"41","author":"Kahng","year":"2022","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.vlsi.2024.102263_b3","doi-asserted-by":"crossref","unstructured":"T. Fontana, E. Aghaeekiasaraee, R. Netto, S. Almeida, U. Gandh, A. Tabrizi, D. Westwick, L. Behjat, J. G\u00fcntzel, ILP-based global routing optimization with cell movements, in: IEEE Computer Society Annual Symposium on VLSI, 2021, pp. 25\u201330.","DOI":"10.1109\/ISVLSI51109.2021.00016"},{"issue":"7","key":"10.1016\/j.vlsi.2024.102263_b4","first-page":"1239","article-title":"DRAPS: A design rule aware path search algorithm for detailed routing","volume":"67","author":"Goncalves","year":"2020","journal-title":"IEEE Trans. Circuits Syst. II"},{"year":"2011","series-title":"VLSI Physical Design: from Graph Partitioning to Timing Closure","author":"Kahng","key":"10.1016\/j.vlsi.2024.102263_b5"},{"issue":"5","key":"10.1016\/j.vlsi.2024.102263_b6","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TCAD.2012.2235124","article-title":"NCTU-GR 2.0: Multithreaded collision-aware global routing with bounded-length maze routing","volume":"32","author":"Liu","year":"2013","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"12","key":"10.1016\/j.vlsi.2024.102263_b7","doi-asserted-by":"crossref","first-page":"1931","DOI":"10.1109\/TCAD.2010.2061590","article-title":"NTHU-route 2.0: A robust global router for modern designs","volume":"29","author":"Chang","year":"2010","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.vlsi.2024.102263_b8","doi-asserted-by":"crossref","unstructured":"H.-Y. Chen, C.-H. Hsu, Y.-W. Chang, High-performance global routing with fast overflow reduction, in: ACM Asia and South Pacific Design Automation Conference, 2009, pp. 582\u2013587.","DOI":"10.1109\/ASPDAC.2009.4796543"},{"key":"10.1016\/j.vlsi.2024.102263_b9","unstructured":"Y. Xu, Y. Zhang, C. Chu, FastRoute 4.0: Global router with efficient via minimization, in: IEEE Asia and South Pacific Design Automation Conference, 2009, pp. 576\u2013581."},{"issue":"6","key":"10.1016\/j.vlsi.2024.102263_b10","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1109\/TCAD.2008.923255","article-title":"High-performance routing at the nanometer scale","volume":"27","author":"Roy","year":"2008","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.vlsi.2024.102263_b11","doi-asserted-by":"crossref","unstructured":"T.-H. Wu, A. Davoodi, J.T. Linderoth, GRIP: Scalable 3D global routing using integer programming, in: ACM\/IEEE Design Automation Conference, 2009, pp. 320\u2013325.","DOI":"10.1145\/1629911.1629999"},{"issue":"7","key":"10.1016\/j.vlsi.2024.102263_b12","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1109\/TCAD.2022.3217668","article-title":"FastGR: Global routing on CPU\u2013GPU with heterogeneous task graph scheduler","volume":"42","author":"Liu","year":"2023","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"2","key":"10.1016\/j.vlsi.2024.102263_b13","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TCAD.2022.3184281","article-title":"GAMER: GPU-accelerated maze routing","volume":"42","author":"Lin","year":"2023","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.vlsi.2024.102263_b14","doi-asserted-by":"crossref","unstructured":"F.-K. Sun, H. Chen, C.-Y. Chen, C.-H. Hsu, Y.-W. Chang, A multithreaded initial detailed routing algorithm considering global routing guides, in: IEEE\/ACM International Conference on Computer-Aided Design, 2018, pp. 1\u20137.","DOI":"10.1145\/3240765.3240777"},{"key":"10.1016\/j.vlsi.2024.102263_b15","unstructured":"C.H. Hsu, H.-Y. Chen, Y.-W. Chang, Multi-layer global routing considering via and wire capacities, in: IEEE\/ACM International Conference on Computer-Aided Design, 2008, pp. 350\u2013355."},{"key":"10.1016\/j.vlsi.2024.102263_b16","doi-asserted-by":"crossref","unstructured":"J. Liu, C.-W. Pui, F. Wang, E.F.Y. Young, CUGR: Detailed-routability-driven 3D global routing with probabilistic resource model, in: ACM\/IEEE Design Automation Conference, 2020, pp. 1\u20136.","DOI":"10.1109\/DAC18072.2020.9218646"},{"issue":"1","key":"10.1016\/j.vlsi.2024.102263_b17","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/TCAD.2007.907068","article-title":"FLUTE: Fast lookup table based rectilinear steiner minimal tree algorithm for VLSI design","volume":"27","author":"Chu","year":"2008","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.vlsi.2024.102263_b18","doi-asserted-by":"crossref","unstructured":"Y.-H. Chen, C.-M. Wu, An improved algorithm for searching maze based on depth-first search, in: IEEE International Conference on Consumer Electronics, 2020, pp. 1\u20132.","DOI":"10.1109\/ICCE-Taiwan49838.2020.9258170"},{"key":"10.1016\/j.vlsi.2024.102263_b19","doi-asserted-by":"crossref","unstructured":"S. Mantik, G. Posser, W.-K. Chow, Y. Ding, W.-H. Liu, ISPD 2018 Initial Detailed Routing Contest and Benchmarks, in: ACM International Symposium on Physical Design, 2018, pp. 140\u2013143.","DOI":"10.1145\/3177540.3177562"},{"key":"10.1016\/j.vlsi.2024.102263_b20","doi-asserted-by":"crossref","unstructured":"W.-H. Liu, S. Mantik, W.-K. Chow, Y. Ding, A. Farshidi, G. Posser, ISPD 2019 Initial Detailed Routing Contest and Benchmarks with Advanced Routing Rules, in: ACM International Symposium on Physical Design, 2019, pp. 147\u2013151.","DOI":"10.1145\/3299902.3311067"},{"key":"10.1016\/j.vlsi.2024.102263_b21","doi-asserted-by":"crossref","unstructured":"H. Huang, W. Chen, Z. Cai, J. Huang, J. Chen, An Efficient Global Router for Large-scale Congestion-driven Routing, in: IEEE 16th International Conference on Solid-State & Integrated Circuit Technology, 2022, pp. 1\u20133.","DOI":"10.1109\/ICSICT55466.2022.9963327"},{"issue":"9","key":"10.1016\/j.vlsi.2024.102263_b22","doi-asserted-by":"crossref","first-page":"1902","DOI":"10.1109\/TCAD.2019.2927542","article-title":"Dr. CU: Detailed routing by sparse grid graph and minimum-area-captured path search","volume":"39","author":"Chen","year":"2020","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926024001275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926024001275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:18:35Z","timestamp":1732652315000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926024001275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":22,"alternative-id":["S0167926024001275"],"URL":"https:\/\/doi.org\/10.1016\/j.vlsi.2024.102263","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A fast and high-performance global router with enhanced congestion control","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.vlsi.2024.102263","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102263"}}