{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:05Z","timestamp":1750220045330,"version":"3.41.0"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"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. Archit. Code Optim."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>Although approximate computing promises better performance for applications allowing marginal errors, dearth of hardware support and lack of run-time accuracy guarantees makes it difficult to adopt. We present As-Is, an Anytime Speculative Interruptible System that takes an approximate program and executes it with time-proportional approximations. That is, an approximate version of the program output is generated early and is gradually refined over time, thus providing the run-time guarantee of eventually reaching 100% accuracy. The novelty of our As-Is architecture is in its ability to conceptually marry approximate computing and speculative computing. We show how existing innovations in speculative architectures can be repurposed for anytime, best-effort approximation, facilitating the design efforts and overheads needed for approximate hardware support. As-Is provides a platform for real-time constraints and interactive users to interrupt programs early and accept their current approximate results as is. 100% accuracy is always guaranteed if more time can be spared. Our evaluations demonstrate favorable performance-accuracy tradeoffs for a range of approximate applications.<\/jats:p>","DOI":"10.1145\/3559761","type":"journal-article","created":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T13:05:15Z","timestamp":1665234315000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["As-Is Approximate Computing"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8584-3266","authenticated-orcid":false,"given":"Mitali","family":"Soni","sequence":"first","affiliation":[{"name":"Google, Mountain View, CA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6949-5070","authenticated-orcid":false,"given":"Asmita","family":"Pal","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6886-7183","authenticated-orcid":false,"given":"Joshua San","family":"Miguel","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI"}]}],"member":"320","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.119"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2014.6853213"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/ESTIMedia.2013.6704499"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806620"},{"key":"e_1_3_1_6_2","volume-title":"PERFECT (Power Efficiency Revolution For Embedded Computing Technologies) Benchmark Suite Manual","author":"Barker Kevin","year":"2013","unstructured":"Kevin Barker, Thomas Benson, Dan Campbell, David Ediger, Roberto Gioiosa, Adolfy Hoisie, Darren Kerbyson, Joseph Manzano, Andres Marquez, Leon Song, Nathan Tallent, and Antonino Tumeo. 2013. PERFECT (Power Efficiency Revolution For Embedded Computing Technologies) Benchmark Suite Manual. Pacific Northwest National Laboratory and Georgia Tech Research Institute. Retrieved from http:\/\/hpc.pnnl.gov\/projects\/PERFECT\/."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837492"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2009.34"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488873"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950373"},{"key":"e_1_3_1_11_2","first-page":"561","volume-title":"Proceedings of the 44th Annual International Symposium on Computer Architecture","author":"Sa Christopher De","year":"2017","unstructured":"Christopher De Sa, Matthew Feldman, Christopher R\u00e9, and Kunle Olukotun. 2017. Understanding and optimizing asynchronous low-precision stochastic gradient descent. In Proceedings of the 44th Annual International Symposium on Computer Architecture. 561\u2013574."},{"key":"e_1_3_1_12_2","first-page":"49","volume-title":"Proceedings of the 7th AAAI National Conference on Artificial Intelligence.","author":"Dean Thomas","year":"1988","unstructured":"Thomas Dean and Mark Boddy. 1988. An analysis of time-dependent planning. In Proceedings of the 7th AAAI National Conference on Artificial Intelligence.AAAI,49\u201354. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=2887965.2887974."},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2591513.2591534"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151008"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2589750"},{"key":"e_1_3_1_16_2","doi-asserted-by":"crossref","unstructured":"Karthik Ganesan Joshua San Miguel and Natalie Enright Jerger. 2019. The what\u2019s next intermittent computing architecture. In Proceedings of the 2019 IEEE International Symposium on High Performance Computer Architecture.","DOI":"10.1109\/HPCA.2019.00039"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2015.7056067"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/AHS.2014.6880184"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941557"},{"key":"e_1_3_1_20_2","first-page":"429","volume-title":"Proceedings of the 3rd Conference on Uncertainty in Artificial Intelligence","author":"Horvitz Eric J.","year":"1987","unstructured":"Eric J. Horvitz. 1987. Reasoning about beliefs and actions under computational resource constraints. In Proceedings of the 3rd Conference on Uncertainty in Artificial Intelligence. AUAI, 429\u2013447."},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783744"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2016.12"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377924"},{"key":"e_1_3_1_24_2","unstructured":"Patrick Judd Jorge Albericio Tayler H. Hetherington Tor M. Aamodt Natalie D. Enright Jerger Raquel Urtasun and Andreas Moshovos. 2015. Reduced-precision strategies for bounded memory in deep neural nets. arXiv:1511.05236. Retrieved from https:\/\/arxiv.org\/abs\/1511.05236."},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2016.2597140"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750371"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2018.2845841"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2907294.2907312"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.5555\/44132.44134"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345236"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2445741"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669172"},{"key":"e_1_3_1_34_2","volume-title":"Proceedings of the International Conference on Computer-Aided Design","author":"Li Sheng","year":"2011","unstructured":"Sheng Li, Ke Chen, Jung Ho Ahn, Jay B. Brockman, and Norman P. Jouppi. 2011. CACTI-P: Architecture-level modeling for SRAM-based structures with advanced leakage reduction techniques. In Proceedings of the International Conference on Computer-Aided Design. IEEE."},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314613"},{"key":"e_1_3_1_37_2","first-page":"1","volume-title":"Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing","author":"Meng Jiayuan","year":"2009","unstructured":"Jiayuan Meng, Srimat T. Chakradhar, and Anand Raghunathan. 2009. Best-effort parallel execution framework for Recognition and mining applications. In Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing. 1\u201312."},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830790"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2014.22"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.54"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660231"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/6462.6485"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2015.7056066"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2013.2281934"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694365"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/2541940.2541948"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540711"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993518"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025133"},{"key":"e_1_3_1_51_2","volume-title":"Introduction to Data Mining","author":"Tan Pang-Ning","year":"2018","unstructured":"Pang-Ning Tan. 2018. Introduction to Data Mining. Pearson Education India."},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/2627369.2627613"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037748"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2016.2630270"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2015.0618"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3559761","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3559761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:57Z","timestamp":1750183677000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3559761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,17]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1145\/3559761"],"URL":"https:\/\/doi.org\/10.1145\/3559761","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2022,11,17]]},"assertion":[{"value":"2021-03-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-15","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}