{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:18Z","timestamp":1750221078219,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T00:00:00Z","timestamp":1549670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2019,3,31]]},"abstract":"<jats:p>This article presents an algorithm for integrated timing-driven latch placement and cloning. Given a circuit placement, the proposed algorithm relocates some latches while circuit timing is improved. Some latches are replicated to further improve the timing; the number of replicated latches along with their locations are automatically determined. After latch cloning, each of the replicated latches is set to drive a subset of the fanouts that have been driven by the original single latch. The proposed algorithm is then extended such that relocation and cloning are applied to some latches together with their neighbor logic gates. Experimental results demonstrate that the worst negative slack and the total negative slack are improved by 24% and 59%, respectively, on average of test circuits. The negative impacts on circuit area and power consumption are both marginal, at 0.7% and 1.9% respectively.<\/jats:p>","DOI":"10.1145\/3301613","type":"journal-article","created":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T13:11:45Z","timestamp":1549890705000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Integrated Latch Placement and Cloning for Timing Optimization"],"prefix":"10.1145","volume":"24","author":[{"given":"Jinwook","family":"Jung","sequence":"first","affiliation":[{"name":"Korea Advanced Institute of Science and Technology, Daejeon, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gi-Joon","family":"Nam","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Woohyun","family":"Chung","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology, Daejeon, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngsoo","family":"Shin","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology, Daejeon, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,2,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"IWLS 2005 Benchmarks. Retrieved","author":"Albrecht Christoph","year":"2005","unstructured":"Christoph Albrecht . 2005 . IWLS 2005 Benchmarks. Retrieved July 18, 2018 from http:\/\/iwls.org\/iwls2005\/benchmarks.html Christoph Albrecht. 2005. IWLS 2005 Benchmarks. Retrieved July 18, 2018 from http:\/\/iwls.org\/iwls2005\/benchmarks.html"},{"key":"e_1_2_1_2_1","volume-title":"Issued","author":"Alpert Charles J.","year":"2015","unstructured":"Charles J. Alpert , Robert M. Averill III, Eric J. Fluhr , Zhuo Li , Tuhin Mahmud , Jose LP Neves , 2015 . Automatic generation of wire tag lists for a metal stack. Patent No. 9092591 , Issued July 28, 2015. Charles J. Alpert, Robert M. Averill III, Eric J. Fluhr, Zhuo Li, Tuhin Mahmud, Jose LP Neves, et al. 2015. Automatic generation of wire tag lists for a metal stack. Patent No. 9092591, Issued July 28, 2015."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855889"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.890096"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2717764.2717778"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687454"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2209117"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277119"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593182"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898105"},{"volume-title":"VLSI Physical Design: From Graph Partitioning to Timing Closure","author":"Kahng Andrew B.","key":"e_1_2_1_12_1","unstructured":"Andrew B. Kahng , Jens Lienig , Igor L. Markov , and Jin Hu. 2011. VLSI Physical Design: From Graph Partitioning to Timing Closure . Springer . Andrew B. Kahng, Jens Lienig, Igor L. Markov, and Jin Hu. 2011. VLSI Physical Design: From Graph Partitioning to Timing Closure. Springer."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735047"},{"volume-title":"Proceedings of the International Conference on Computer-Aided Design. 204--211","author":"Luo Tao","key":"e_1_2_1_14_1","unstructured":"Tao Luo , David A. Papa , Zhuo Li , Chin Ngai Sze , Charles J. Alpert , and David Z. Pan . 2008. Pyramids: An efficient computational geometry-based approach for timing-driven placement . In Proceedings of the International Conference on Computer-Aided Design. 204--211 . Tao Luo, David A. Papa, Zhuo Li, Chin Ngai Sze, Charles J. Alpert, and David Z. Pan. 2008. Pyramids: An efficient computational geometry-based approach for timing-driven placement. In Proceedings of the International Conference on Computer-Aided Design. 204--211."},{"volume-title":"Retrieved","year":"2018","key":"e_1_2_1_15_1","unstructured":"OpenCores. 2018 . OpenCores . Retrieved July 18, 2018 from http:\/\/www.opencores.org\/. OpenCores. 2018. OpenCores. Retrieved July 18, 2018 from http:\/\/www.opencores.org\/."},{"key":"e_1_2_1_16_1","volume-title":"Retrieved","author":"Optimization Gurobi","year":"2018","unstructured":"Gurobi Optimization . 2018 . Gurobi Optimizer Reference Manual . Retrieved July 18, 2018 from http:\/\/www.gurobi.com\/documentation\/8.0\/refman\/refman.html. Gurobi Optimization. 2018. Gurobi Optimizer Reference Manual. Retrieved July 18, 2018 from http:\/\/www.gurobi.com\/documentation\/8.0\/refman\/refman.html."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/274535.274550"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2006155"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/981066.981070"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825841"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/986333.986337"},{"key":"e_1_2_1_22_1","unstructured":"Synopsys 2016. Design Compiler User Guide. Synopsys.  Synopsys 2016. Design Compiler User Guide. Synopsys."},{"key":"e_1_2_1_23_1","unstructured":"Synopsys 2016. IC Compiler User Guide. Synopsys.  Synopsys 2016. IC Compiler User Guide. Synopsys."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735048"},{"volume-title":"Proceedings of the Conference on Design, Automation, and Test in Europe. 1873--1878","author":"Wei Yaoguang","key":"e_1_2_1_25_1","unstructured":"Yaoguang Wei , Zhuo Li , Cliff Sze , Shiyan Hu , Charles J. Alpert , and Sachin S. Sapatnekar . 2013. CATALYST: Planning layer directives for effective design closure . In Proceedings of the Conference on Design, Automation, and Test in Europe. 1873--1878 . Yaoguang Wei, Zhuo Li, Cliff Sze, Shiyan Hu, Charles J. Alpert, and Sachin S. Sapatnekar. 2013. CATALYST: Planning layer directives for effective design closure. In Proceedings of the Conference on Design, Automation, and Test in Europe. 1873--1878."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3301613","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3301613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:36Z","timestamp":1750208256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3301613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,9]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3,31]]}},"alternative-id":["10.1145\/3301613"],"URL":"https:\/\/doi.org\/10.1145\/3301613","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2019,2,9]]},"assertion":[{"value":"2018-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}