{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:59Z","timestamp":1750308599815,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,5,11]],"date-time":"2016-05-11T00:00:00Z","timestamp":1462924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Doctoral Program of Higher Education of China","award":["20120001120124"],"award-info":[{"award-number":["20120001120124"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61202073"],"award-info":[{"award-number":["61202073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Beijing Natural Science Foundation","award":["4142022"],"award-info":[{"award-number":["4142022"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2016,7,26]]},"abstract":"<jats:p>Circuit clustering is usually done through discrete optimizations to enable circuit size reduction or design-specific cluster formation. In this article, we are interested in the register-clustering technique for clock-power reduction by leveraging new opportunities introduced by multibit flip-flop (MBFF). Currently, INTEGRA is the only existing postplacement MBFF clustering optimizer with a subquadratic time complexity. However, it severely degrades the wirelength, especially for realistic designs, which may nullify the benefits of MBFF clustering. In contrast, we formulate an analytical clustering score with a nonlinear programming framework, in which the wirelength objective can be seamlessly integrated and the solver has empirical subquadratic time complexity. With the MBFF library, the application of our analytical clustering method achieves comparable clock power to the state-of-the-art techniques, but further reduces the wirelength by about 25%. Even without the MBFF library, we can still achieve 30% clock wirelength reduction. In addition, the proposed method can potentially be integrated into an in-placement MBFF clustering solver and be applied to other problems that require formulating clustering scores in their objective functions.<\/jats:p>","DOI":"10.1145\/2894753","type":"journal-article","created":{"date-parts":[[2016,5,13]],"date-time":"2016-05-13T14:30:58Z","timestamp":1463149858000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Analytical Clustering Score with Application to Postplacement Register Clustering"],"prefix":"10.1145","volume":"21","author":[{"given":"Chang","family":"Xu","sequence":"first","affiliation":[{"name":"Peking University, Beijing"}]},{"given":"Guojie","family":"Luo","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Peixin","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University, Beijing"}]},{"given":"Yiyu","family":"Shi","sequence":"additional","affiliation":[{"name":"University of Notre Dame, IN"}]},{"given":"Iris Hui-Ru","family":"Jiang","sequence":"additional","affiliation":[{"name":"National Chiao Tung University, Hsinchu City, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2016,5,11]]},"reference":[{"volume-title":"IWLS 2005 benchmarks. Retrieved","year":"2005","author":"Albrecht Christoph","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055179"},{"key":"e_1_2_1_3_1","unstructured":"Cadence. 2005. Cadence Encounter user manual. http:\/\/www.ece.utep.edu\/courses\/web5375\/Links_files\/4.1.pdf.  Cadence. 2005. Cadence Encounter user manual. http:\/\/www.ece.utep.edu\/courses\/web5375\/Links_files\/4.1.pdf."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2010.5647784"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065791"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2009.4810370"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2561828.2561946"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024875"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1960397.1960424"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2170567"},{"key":"e_1_2_1_11_1","unstructured":"Yaron Kretchmer and LSI Logic. 2001. Using multi-bit register inference to save area and power: The good the bad and the ugly. EE Times Asia.  Yaron Kretchmer and LSI Logic. 2001. Using multi-bit register inference to save area and power: The good the bad and the ugly. EE Times Asia."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2165716"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593133"},{"key":"e_1_2_1_14_1","unstructured":"Vlad I. Morariu Balaji V. Srinivasan Vikas C. Raykar Ramani Duraiswami and Larry S. Davis. 2009. Automatic online tuning for fast Gaussian summation. In Advances in Neural Information Processing Systems 21 D. Koller D. Schuurmans Y. Bengio and L. Bottou (Eds.). Curran Associates Inc. Red Hook NY. 1113--1120.  Vlad I. Morariu Balaji V. Srinivasan Vikas C. Raykar Ramani Duraiswami and Larry S. Davis. 2009. Automatic online tuning for fast Gaussian summation. In Advances in Neural Information Processing Systems 21 D. Koller D. Schuurmans Y. Bengio and L. Bottou (Eds.). Curran Associates Inc. Red Hook NY. 1113--1120."},{"key":"e_1_2_1_15_1","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/k2)","volume":"27","author":"Nesterov Yurii","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1988-0961614-2"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108011"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.925783"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2451916.2451955"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2177460"},{"volume-title":"Proceedings of the International Conference on Computer-Aided Design. IEEE Press, 599--606","author":"Ward Samuel I.","key":"e_1_2_1_21_1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888270"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2114950"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICGCS.2010.5542978"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2894753","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2894753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:40Z","timestamp":1750273540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2894753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,11]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7,26]]}},"alternative-id":["10.1145\/2894753"],"URL":"https:\/\/doi.org\/10.1145\/2894753","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2016,5,11]]},"assertion":[{"value":"2015-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}