{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:43Z","timestamp":1750221283045,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T00:00:00Z","timestamp":1511913600000},"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":[[2018,3,31]]},"abstract":"<jats:p>The better-than-worst-case (BTW) design methodology can achieve higher circuit energy efficiency, performance, or reliability by allowing timing errors for rare cases and rectifying them with error correction mechanisms. Therefore, the performance of BTW design heavily depends on the correctness of common cases, which are frequent input patterns in a workload. However, most existing methods do not provide sufficiently scalable solutions and also overlook the whole picture of the design. Thus, we propose a new technique, common-case mining method (C-Mine), which combines two scalable techniques, data mining and Boolean satisfiability (SAT) solving, to overcome these limitations. Data mining can efficiently extract patterns from an enormous dataset, and SAT solving is famous for its scalable verification. In this article, we present two versions of C-Mine, C-Mine-DCT and C-Mine-APR, which aim at faster runtime and better energy saving, respectively. The experimental results show that, compared to a recent publication, C-Mine-DCT can achieve compatible performance with an additional 8% energy savings and 54x speedup for bigger benchmarks on average. Furthermore, C-Mine-APR can achieve up to 13% more energy saving than C-Mine-DCT while confronting designs with more common cases.<\/jats:p>","DOI":"10.1145\/3144534","type":"journal-article","created":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T13:57:44Z","timestamp":1511963864000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["C-Mine"],"prefix":"10.1145","volume":"23","author":[{"given":"Chen-Hsuan","family":"Lin","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Wan","sequence":"additional","affiliation":[{"name":"Cadence Design Systems, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deming","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,11,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/LES.2010.2098330"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases (VLDB\u201994)","volume":"1215","author":"Agrawal Rakesh","year":"1994","unstructured":"Rakesh Agrawal , Ramakrishnan Srikant , 1994 . Fast algorithms for mining association rules . In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB\u201994) , Vol. 1215 . 487--499. Rakesh Agrawal, Ramakrishnan Srikant, et al. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB\u201994), Vol. 1215. 487--499."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120725.1120878"},{"volume-title":"Proceedings of the 23rd International Conference on Computer Design (ICCD\u201905)","author":"Todd","key":"e_1_2_1_4_1","unstructured":"Todd M. Austin and Valeria Bertacco. 2005. Deployment of better than worst-case design: Solutions and needs . In Proceedings of the 23rd International Conference on Computer Design (ICCD\u201905) , 550--555. Todd M. Austin and Valeria Bertacco. 2005. Deployment of better than worst-case design: Solutions and needs. In Proceedings of the 23rd International Conference on Computer Design (ICCD\u201905), 550--555."},{"volume-title":"Handbook of Satisfiability","author":"Biere Armin","key":"e_1_2_1_5_1","unstructured":"Armin Biere , Marijn Heule , and Hans van Maaren . 2009. Handbook of Satisfiability . Vol. 185 . IOS Press . Armin Biere, Marijn Heule, and Hans van Maaren. 2009. Handbook of Satisfiability. Vol. 185. IOS Press."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1629915"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICICDT.2009.5166300"},{"volume-title":"Theory and Applications of Satisfiability Testing","author":"E\u00e9n Niklas","key":"e_1_2_1_8_1","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . 2003. An extensible SAT-solver . In Theory and Applications of Satisfiability Testing . Springer , 502--518. Niklas E\u00e9n and Niklas S\u00f6rensson. 2003. An extensible SAT-solver. In Theory and Applications of Satisfiability Testing. Springer, 502--518."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.85"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2003.1253179"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2009.4798256"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_45"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-40922-X_22"},{"key":"e_1_2_1_14_1","volume-title":"Data Mining: Concepts and Techniques","author":"Han Jiawei","year":"2011","unstructured":"Jiawei Han , Micheline Kamber , and Jian Pei . 2011 . Data Mining: Concepts and Techniques . Elsevier . Jiawei Han, Micheline Kamber, and Jian Pei. 2011. Data Mining: Concepts and Techniques. Elsevier."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1899721.1899911"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593107"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429512"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09823-4"},{"volume-title":"Computer Aided Verification","author":"McMillan Kenneth L","key":"e_1_2_1_19_1","unstructured":"Kenneth L McMillan . 2003. Interpolation and SAT-based model checking . In Computer Aided Verification . Springer , 1--13. Kenneth L McMillan. 2003. Interpolation and SAT-based model checking. In Computer Aided Verification. Springer, 1--13."},{"key":"e_1_2_1_20_1","volume-title":"ABC: A system for sequential synthesis and verification.","author":"Alan Mishchenko","year":"2011","unstructured":"Alan Mishchenko et al. 2011 . ABC: A system for sequential synthesis and verification. Retrieved from https:\/\/people.eecs.berkeley.edu\/&sim;alanmi\/abc\/. Alan Mishchenko et al. 2011. ABC: A system for sequential synthesis and verification. Retrieved from https:\/\/people.eecs.berkeley.edu\/&sim;alanmi\/abc\/."},{"key":"e_1_2_1_21_1","volume-title":"Sutherland","author":"Molnar Charles E.","year":"1994","unstructured":"Charles E. Molnar , Robert F. Sproull , and Ivan E . Sutherland . 1994 . Counterflow Pipeline Processor Architecture. Technical report. Mountain View, CA. Charles E. Molnar, Robert F. Sproull, and Ivan E. Sutherland. 1994. Counterflow Pipeline Processor Architecture. Technical report. Mountain View, CA."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(86)80028-1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488871"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687414"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2010.5457129"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687430"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2333660.2333695"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3144534","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3144534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:22Z","timestamp":1750212682000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3144534"}},"subtitle":["Data Mining of Logic Common Cases for Improved Timing Error Resilience with Energy Efficiency"],"short-title":[],"issued":{"date-parts":[[2017,11,29]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3,31]]}},"alternative-id":["10.1145\/3144534"],"URL":"https:\/\/doi.org\/10.1145\/3144534","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2017,11,29]]},"assertion":[{"value":"2017-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-11-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}