乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T05:08:29Z","timestamp":1733634509544,"version":"3.30.1"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1016\/j.vlsi.2024.102264","type":"journal-article","created":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T21:20:24Z","timestamp":1725139224000},"page":"102264","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An analytical placement algorithm with looking-ahead routing topology optimization"],"prefix":"10.1016","volume":"100","author":[{"given":"Min","family":"Wei","sequence":"first","affiliation":[]},{"given":"Xingyu","family":"Tong","sequence":"additional","affiliation":[]},{"given":"Zhijie","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Zou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5881-2604","authenticated-orcid":false,"given":"Zhifeng","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jianli","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.vlsi.2024.102264_b1","doi-asserted-by":"crossref","unstructured":"Lixin Liu, Bangqi Fu, Martin D.F. Wong, Evangeline F. Y. Young, Xplace: an extremely fast and extensible global placement framework, in: Proceedings of the 59th Design Automation Conference, 2022.","DOI":"10.1145\/3489517.3530485"},{"key":"10.1016\/j.vlsi.2024.102264_b2","unstructured":"Meng-Kai Hsu, Yao-Wen Chang, Valeriy Balabanov, TSV-aware analytical placement for 3D IC designs, in: Proceedings of the 48th Design Automation Conference, 2011."},{"issue":"4","key":"10.1016\/j.vlsi.2024.102264_b3","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/TCAD.2020.3003843","article-title":"DREAMPlace: Deep learning toolkit-enabled GPU acceleration for modern VLSI placement","volume":"40","author":"Lin","year":"2021","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"9","key":"10.1016\/j.vlsi.2024.102264_b4","doi-asserted-by":"crossref","first-page":"1717","DOI":"10.1109\/TCAD.2018.2859220","article-title":"RePlAce: Advancing solution quality and routability validation in global placement","volume":"38","author":"Cheng","year":"2019","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"10.1016\/j.vlsi.2024.102264_b5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1109\/TCAD.2003.809661","article-title":"Multilevel global placement with congestion control","volume":"22","author":"Chang","year":"2003","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"7","key":"10.1016\/j.vlsi.2024.102264_b6","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/TCAD.2008.923063","article-title":"NTUplace3: An analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints","volume":"27","author":"Chen","year":"2008","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.vlsi.2024.102264_b7","series-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design","first-page":"520","article-title":"POLAR 3.0: An ultrafast global placement engine","author":"Lin","year":"2015"},{"issue":"1","key":"10.1016\/j.vlsi.2024.102264_b8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/TCAD.2011.2170567","article-title":"SimPL: An effective placement algorithm","volume":"31","author":"Kim","year":"2012","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"8","key":"10.1016\/j.vlsi.2024.102264_b9","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1109\/TCAD.2008.925783","article-title":"Kraftwerk2 - A fast force-directed quadratic placement approach using an accurate net model","volume":"27","author":"Spindler","year":"2008","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"10.1016\/j.vlsi.2024.102264_b10","doi-asserted-by":"crossref","unstructured":"Georg Sigl, Konrad Doll, Frank M. Johannes, Analytical Placement: A Linear or a Quadratic Objective Function?, in: Proceedings of the 28th Design Automation Conference, 1991.","DOI":"10.1145\/127601.127707"},{"issue":"4","key":"10.1016\/j.vlsi.2024.102264_b11","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1109\/TCAD.2006.888260","article-title":"Seeing the forest and the trees: Steiner wirelength optimization in placement","volume":"26","author":"Roy","year":"2007","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"9","key":"10.1016\/j.vlsi.2024.102264_b12","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1109\/43.784119","article-title":"On wirelength estimations for row-based placement","volume":"18","author":"Caldwell","year":"1999","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"10.1016\/j.vlsi.2024.102264_b13","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","article-title":"On steiner minimal trees with rectilinear distance","volume":"30","author":"Hwang","year":"1976","journal-title":"SIAM J. Appl. Math."},{"issue":"11","key":"10.1016\/j.vlsi.2024.102264_b14","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1109\/TVLSI.2022.3201946","article-title":"PPOM: An effective post-global placement optimization methodology for better wirelength and routability","volume":"30","author":"Lin","year":"2022","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"issue":"12","key":"10.1016\/j.vlsi.2024.102264_b15","doi-asserted-by":"crossref","first-page":"1914","DOI":"10.1109\/TCAD.2014.2360453","article-title":"NTUplace4h: A novel routability-driven placement algorithm for hierarchical mixed-size circuit designs","volume":"33","author":"Hsu","year":"2014","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"2","key":"10.1016\/j.vlsi.2024.102264_b16","first-page":"17:1","article-title":"ePlace: Electrostatics-based placement using fast Fourier transform and nesterov\u2019s method","volume":"20","author":"Lu","year":"2015","journal-title":"ACM Trans. Des. Autom. Electr. Syst."},{"issue":"1","key":"10.1016\/j.vlsi.2024.102264_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.102264_b18","series-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design","first-page":"921","article-title":"ICCAD-2015 CAD contest in incremental timing-driven placement and benchmark suite","author":"Kim","year":"2015"},{"year":"2022","series-title":"Innovus implementation system","key":"10.1016\/j.vlsi.2024.102264_b19"},{"issue":"4","key":"10.1016\/j.vlsi.2024.102264_b20","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1109\/TCAD.2020.3007319","article-title":"OpenTimer v2: A new parallel incremental timing analysis engine","volume":"40","author":"Huang","year":"2021","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:S0167926024001287?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926024001287?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T09:12:35Z","timestamp":1733562755000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926024001287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":20,"alternative-id":["S0167926024001287"],"URL":"https:\/\/doi.org\/10.1016\/j.vlsi.2024.102264","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An analytical placement algorithm with looking-ahead routing topology optimization","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.vlsi.2024.102264","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":"102264"}}