{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:43:32Z","timestamp":1787017412952,"version":"3.56.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"5s","license":[{"start":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T00:00:00Z","timestamp":1570406400000},"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. Embed. Comput. Syst."],"published-print":{"date-parts":[[2019,10,31]]},"abstract":"<jats:p>Approximate computing has emerged as a design paradigm amenable to error-tolerant applications. It enables trading the quality of results for efficiency improvement in terms of delay, power, and energy consumption under user-provided tolerable quality degradation. Approximate accelerators have been proposed to expedite frequently executing code sections of error-resilient applications while meeting a defined quality level. However, these accelerators may produce unacceptable errors at run time if the input data changes or dynamic adjustments are made for a defined output quality constraint. State-of-the-art approaches in approximate computing address this issue by correctly re-computing those accelerator invocations that produce unacceptable errors; this is achieved by using the host processor or an alternate exact accelerator, which is activated on-demand. Nevertheless, such approaches can nullify the benefits of approximate computing, especially when input data variations are high at run time and errors due to approximations are above a tolerable threshold. As a robust and general solution to this problem, we propose ECAx, a novel methodology to explore low-overhead error correction in approximate accelerators by selectively correcting most significant errors, in terms of their magnitude, without losing the gains of approximations. We particularly consider the case of approximate accelerators built with approximate functional units such as approximate adders. Our novel methodology reduces the required exact re-computations on the host processor, achieving up to 20% performance gain compared to state-of-the-art approaches.<\/jats:p>","DOI":"10.1145\/3358179","type":"journal-article","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T09:13:05Z","timestamp":1570698785000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["ECAx"],"prefix":"10.1145","volume":"18","author":[{"given":"Jorge","family":"Castro-God\u00ednez","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muhammad","family":"Shafique","sequence":"additional","affiliation":[{"name":"Vienna University of Technology (TU Wien), Treitlstra\u00dfe, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg","family":"Henkel","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,10,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062319"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201910)","author":"Baek Woongki","year":"1806","unstructured":"Woongki Baek and Trishul M. Chilimbi . 2010. Green: A framework for supporting energy-conscious programming using controlled approximation . In Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201910) . ACM, New York, NY, USA, 198--209. DOI:https:\/\/doi.org\/10.1145\/ 1806 596.1806620 Woongki Baek and Trishul M. Chilimbi. 2010. Green: A framework for supporting energy-conscious programming using controlled approximation. In Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201910). ACM, New York, NY, USA, 198--209. DOI:https:\/\/doi.org\/10.1145\/1806596.1806620"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2014.6783335"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2514740"},{"key":"e_1_2_1_5_1","volume-title":"Automation Test in Europe Conference Exhibition (DATE). 1027--1032","author":"Castro-God\u00ednez Jorge","year":"2018","unstructured":"Jorge Castro-God\u00ednez , Sven Esser , Muhammad Shafique , Santiago Pagani , and J\u00f6rg Henkel . 2018 . Compiler-driven error analysis for designing approximate accelerators. In 2018 Design , Automation Test in Europe Conference Exhibition (DATE). 1027--1032 . DOI:https:\/\/doi.org\/10.23919\/DATE.2018.8342163 Jorge Castro-God\u00ednez, Sven Esser, Muhammad Shafique, Santiago Pagani, and J\u00f6rg Henkel. 2018. Compiler-driven error analysis for designing approximate accelerators. In 2018 Design, Automation Test in Europe Conference Exhibition (DATE). 1027--1032. DOI:https:\/\/doi.org\/10.23919\/DATE.2018.8342163"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488873"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2596667"},{"key":"e_1_2_1_8_1","volume-title":"Automation Test in Europe Conference Exhibition (DATE). 188--193","author":"Del Barrio Alberto A.","year":"2013","unstructured":"Alberto A. Del Barrio , Roman Hermida , Seda Ogrenci Memik , Jose M. Mendias , and Maria C. Molina . 2013. Multispeculative additive trees in high-level synthesis. In 2013 Design , Automation Test in Europe Conference Exhibition (DATE). 188--193 . DOI:https:\/\/doi.org\/10.7873\/DATE. 2013 .052 Alberto A. Del Barrio, Roman Hermida, Seda Ogrenci Memik, Jose M. Mendias, and Maria C. Molina. 2013. Multispeculative additive trees in high-level synthesis. In 2013 Design, Automation Test in Europe Conference Exhibition (DATE). 188--193. DOI:https:\/\/doi.org\/10.7873\/DATE.2013.052"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2016.101"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2012.48"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2868036"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2015.7372600"},{"key":"e_1_2_1_13_1","volume-title":"Patterson","author":"Hennessy John L.","year":"2012","unstructured":"John L. Hennessy and David A . Patterson . 2012 . Computer Architecture : A Quantitative Approach (5 ed.). Morgan Kaufmann . John L. Hennessy and David A. Patterson. 2012. Computer Architecture: A Quantitative Approach (5 ed.). Morgan Kaufmann."},{"key":"e_1_2_1_14_1","volume-title":"DAC Design Automation Conference","author":"Andrew","year":"2012","unstructured":"Andrew B. Kahng and Seokhyeong Kang. 2012. Accuracy-configurable adder for approximate arithmetic designs . In DAC Design Automation Conference 2012 . 820--825. DOI:https:\/\/doi.org\/10.1145\/2228360.2228509 Andrew B. Kahng and Seokhyeong Kang. 2012. Accuracy-configurable adder for approximate arithmetic designs. In DAC Design Automation Conference 2012. 820--825. DOI:https:\/\/doi.org\/10.1145\/2228360.2228509"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750371"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744863"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/TC.2012.146","article-title":"New metrics for the reliability of approximate and probabilistic adders","volume":"62","author":"Liang Jinghang","year":"2013","unstructured":"Jinghang Liang , Jie Han , and Fabrizio Lombardi . 2013 . New metrics for the reliability of approximate and probabilistic adders . IEEE Trans. Comput. 62 , 9 (Sep. 2013), 1760--1771. DOI:https:\/\/doi.org\/10.1109\/TC.2012.146 Jinghang Liang, Jie Han, and Fabrizio Lombardi. 2013. New metrics for the reliability of approximate and probabilistic adders. IEEE Trans. Comput. 62, 9 (Sep. 2013), 1760--1771. DOI:https:\/\/doi.org\/10.1109\/TC.2012.146","journal-title":"IEEE Trans. Comput."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.16"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2009.2027626"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2897981"},{"key":"e_1_2_1_21_1","first-page":"3","article-title":"Probabilistic error modeling for approximate adders","volume":"66","author":"Mazahir Sana","year":"2017","unstructured":"Sana Mazahir , Osman Hasan , Rehan Hafiz , Muhammad Shafique , and J\u00f6rg Henkel . 2017 . Probabilistic error modeling for approximate adders . IEEE Trans. Comput. 66 , 3 (March 2017), 515--530. DOI:https:\/\/doi.org\/10.1109\/TC.2016.2605382 Sana Mazahir, Osman Hasan, Rehan Hafiz, Muhammad Shafique, and J\u00f6rg Henkel. 2017. Probabilistic error modeling for approximate adders. IEEE Trans. Comput. 66, 3 (March 2017), 515--530. DOI:https:\/\/doi.org\/10.1109\/TC.2016.2605382","journal-title":"IEEE Trans. Comput."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2017.2772874"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540711"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2744778"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2906199"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2017.29"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Ajay K. Verma Phillip Brisk and Paolo Ienne. 2008. Variable latency speculative addition: A new paradigm for arithmetic circuit design. In 2008 Design Automation and Test in Europe. 1250--1255. DOI:https:\/\/doi.org\/10.1109\/DATE.2008.4484850  Ajay K. Verma Phillip Brisk and Paolo Ienne. 2008. Variable latency speculative addition: A new paradigm for arithmetic circuit design. In 2008 Design Automation and Test in Europe. 1250--1255. DOI:https:\/\/doi.org\/10.1109\/DATE.2008.4484850","DOI":"10.1109\/DATE.2008.4484850"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934583.2934608"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2015.2505723"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2735299"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2013.6691096"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 2009 12th International Symposium on Integrated Circuits. 69--72","author":"Zhu Ning","year":"2009","unstructured":"Ning Zhu , Wang Ling Goh , and Kiat Seng Yeo . 2009 . An enhanced low-power high-speed adder for error-tolerant application . In Proceedings of the 2009 12th International Symposium on Integrated Circuits. 69--72 . Ning Zhu, Wang Ling Goh, and Kiat Seng Yeo. 2009. An enhanced low-power high-speed adder for error-tolerant application. In Proceedings of the 2009 12th International Symposium on Integrated Circuits. 69--72."}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3358179","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3358179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:32:58Z","timestamp":1750185178000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3358179"}},"subtitle":["Balancing Error Correction Costs in Approximate Accelerators"],"short-title":[],"issued":{"date-parts":[[2019,10,7]]},"references-count":32,"journal-issue":{"issue":"5s","published-print":{"date-parts":[[2019,10,31]]}},"alternative-id":["10.1145\/3358179"],"URL":"https:\/\/doi.org\/10.1145\/3358179","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,7]]},"assertion":[{"value":"2019-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}