{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:37Z","timestamp":1750219777148,"version":"3.41.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T00:00:00Z","timestamp":1684281600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Institute of Information and communications Technology Planning and Evaluation"},{"name":"Korea Government (MSIT) through Software Systems for AI Semiconductor Design","award":["2021-0-00754"],"award-info":[{"award-number":["2021-0-00754"]}]},{"DOI":"10.13039\/501100003661","name":"Korea Institute for Advancement of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003661","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Korea Government","award":["P0017011"],"award-info":[{"award-number":["P0017011"]}]},{"name":"National Research Foundation of Korea (NRF) of MSIT","award":["2019R1A2C2003402"],"award-info":[{"award-number":["2019R1A2C2003402"]}]},{"name":"IC Design Education Center (IDEC), Korea"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2023,7,31]]},"abstract":"<jats:p>Circuits that are placed with very low (or high) aspect ratio are susceptible to routing overflows. Such designs are difficult to close and usually end up with larger area with low area utilization. In this article, we propose two routability optimization methods to implement designs even with very low (or high) aspect ratio and high area utilization. First, we find the best assignment of non-uniform placement utilization through convolutional neural network model, and cell placement is performed while respecting the placement utilization. This allows many cells to be spread out over the entire design rather than being centered. The experiments show that most overflows of 16.5% occurring in cell placement are removed with 23.1% reduction in wire length; this is the result of further improving overflow of 9.8% compared to a conventional method. In the second, some flip-flops are selectively stacked to reduce the routing resources used for clock routing. U-Net model is built with graph attention network to predict the congestion after clock-tree synthesis, and the flip-flops in highly congested areas are selected for stacking. The proposed method improves the overflows, which occurs after clock-tree synthesis, by 22.1%.<\/jats:p>","DOI":"10.1145\/3573387","type":"journal-article","created":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T12:04:40Z","timestamp":1677499480000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Routability Optimization of Extreme Aspect Ratio Design through Non-uniform Placement Utilization and Selective Flip-flop Stacking"],"prefix":"10.1145","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0576-9666","authenticated-orcid":false,"given":"Daijoon","family":"Hyun","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering, Cheongju University, Cheongwon-gu, Cheongju, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9568-7153","authenticated-orcid":false,"given":"Sunwha","family":"Koh","sequence":"additional","affiliation":[{"name":"LX Semicon, Seocho-gu, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4850-4059","authenticated-orcid":false,"given":"Younggwang","family":"Jung","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daehak-ro, Yuseong-gu, Daejeon, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2650-5915","authenticated-orcid":false,"given":"Taeyoung","family":"Kim","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daehak-ro, Yuseong-gu, Daejeon, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7474-9212","authenticated-orcid":false,"given":"Youngsoo","family":"Shin","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daehak-ro, Yuseong-gu, Daejeon, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,5,17]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-2255-4"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.2010.5434080"},{"key":"e_1_3_2_4_2","first-page":"398","volume-title":"Proceedings of the IEEE International Solid-State Circuits Conference.","author":"Lee Soo-Min","year":"2017","unstructured":"Soo-Min Lee et\u00a0al. 2017. 23.6 A 0.6 V 4.266 Gb\/s\/pin LPDDR4X interface with auto-DQS cleaning and write-VWM training for memory controller. In Proceedings of the IEEE International Solid-State Circuits Conference.398\u2013399."},{"key":"e_1_3_2_5_2","author":"Synopsys","year":"2019","unstructured":"Synopsys 2019. IC Compiler User Guide. Synopsys.","journal-title":"IC Compiler User Guide"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/43.974139"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/981066.981110"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.809662"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/332357.332392"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277121"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488922"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593181"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/2132325.2132346"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2859220"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643544"},{"key":"e_1_3_2_16_2","first-page":"573","volume-title":"Proceedings of the International Conference on Computer Aided Design.","author":"Yang Xiaojian","year":"2001","unstructured":"Xiaojian Yang, Ryan Kastner, and Majid Sarrafzadeh. 2001. Congestion reduction during placement based on integer programming. In Proceedings of the International Conference on Computer Aided Design.573\u2013576."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.818375"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.8361580"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3040078"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2966998"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/2133429.2133474"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/1960397.1960423"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Sean Shih-Ying Liu Wan-Ting Lo Chieh-Jui Lee and Hung-Ming Chen. 2013. Agglomerative-based flip-flop merging and relocation for signal wirelength and clock-tree optimization. ACM Trans. on Design Automation of Electronic Systems 18 3 (2013) 1\u201320.","DOI":"10.1145\/2491477.2491484"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2967047"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2698025"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.809649"},{"key":"e_1_3_2_27_2","first-page":"696","volume-title":"Proceedings of the Design, Automation and Test in Europe Conference.","author":"Sham Chiu-Wing","year":"2002","unstructured":"Chiu-Wing Sham, Wai-Chiu Wong, and E. F. Y. Young. 2002. Congestion estimation with buffer planning in floorplan design. In Proceedings of the Design, Automation and Test in Europe Conference.696\u2013701."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/775832.776036"},{"key":"e_1_3_2_29_2","first-page":"615","volume-title":"Proceedings of the Asia South Pacific Design Automation Conference.","author":"Chen Song","year":"2004","unstructured":"Song Chen et\u00a0al. 2004. A buffer planning algorithm with congestion optimization. In Proceedings of the Asia South Pacific Design Automation Conference.615\u2013620."},{"issue":"56","key":"e_1_3_2_30_2","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava N.","year":"2014","unstructured":"N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov. 2014. Dropout: A simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15, 56 (2014), 1929\u20131958.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_31_2","first-page":"226","volume-title":"Proceedings of the International Conference on Knowledge Discovery and Data Mining","volume":"96","author":"Ester Martin","year":"1996","unstructured":"Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, Vol. 96. 226\u2013231."},{"key":"e_1_3_2_32_2","first-page":"281","volume-title":"Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability","volume":"1","author":"MacQueen James","year":"1967","unstructured":"James MacQueen et\u00a0al. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1. 281\u2013297."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.324"},{"key":"e_1_3_2_34_2","unstructured":"ITC99. ([n. d.]). Retrieved from http:\/\/www.cerc.utexas.edu\/itc99-benchmarks\/bench.html. Accessed: May 21 2021."},{"key":"e_1_3_2_35_2","unstructured":"OpenCores. ([n. d.]). Retrieved from http:\/\/www.opencores.org. Accessed: May 21 2021."},{"key":"e_1_3_2_36_2","volume-title":"Design Compiler User Guide","author":"Synopsys","year":"2015","unstructured":"Synopsys 2015. Design Compiler User Guide. Synopsys."},{"key":"e_1_3_2_37_2","first-page":"265","volume-title":"Proceedings of the USENIX Symposium on Operation Systems Design and Implementation.","author":"Abadi Mart\u00edn","year":"2016","unstructured":"Mart\u00edn Abadi et\u00a0al. 2016. TensorFlow: A system for large-scale machine learning. In Proceedings of the USENIX Symposium on Operation Systems Design and Implementation.265\u2013283."},{"key":"e_1_3_2_38_2","unstructured":"Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. Retrieved from https:\/\/arXiv:1412.6980."},{"key":"e_1_3_2_39_2","first-page":"1","volume-title":"Proceedings of the Conference on Advances In Neural Information Processing Systems.","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke et\u00a0al. 2019. Pytorch: An imperative style, high-performance deep learning library. In Proceedings of the Conference on Advances In Neural Information Processing Systems.1\u201312."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573387","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3573387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:37Z","timestamp":1750178257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3573387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,17]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7,31]]}},"alternative-id":["10.1145\/3573387"],"URL":"https:\/\/doi.org\/10.1145\/3573387","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2023,5,17]]},"assertion":[{"value":"2022-04-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-12","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}