{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:28Z","timestamp":1750220968855,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T00:00:00Z","timestamp":1564963200000},"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":[],"published-print":{"date-parts":[[2019,8,5]]},"DOI":"10.1145\/3337821.3337824","type":"proceedings-article","created":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T12:34:36Z","timestamp":1564058076000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["AVR"],"prefix":"10.1145","author":[{"given":"Albin","family":"Eldst\u00e5l-Damlin","sequence":"first","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}]},{"given":"Pedro","family":"Trancoso","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}]},{"given":"Ioannis","family":"Sourdis","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2019,8,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2015. NVIDIA Tegra X1: NVIDIA's New Mobile Superchip. whitepaper.  2015. NVIDIA Tegra X1: NVIDIA's New Mobile Superchip. whitepaper."},{"key":"e_1_3_2_1_2_1","unstructured":"2016. Swedish Topological Survey HDB 50+ V\u00e4stra G\u00f6taland zone 63_3. Retrieved 2016-01-13 from https:\/\/www.lantmateriet.se\/  2016. Swedish Topological Survey HDB 50+ V\u00e4stra G\u00f6taland zone 63_3. Retrieved 2016-01-13 from https:\/\/www.lantmateriet.se\/"},{"key":"e_1_3_2_1_3_1","unstructured":"2018. 1D K-Means Open Source. Retrieved 2018-10-13 from https:\/\/github.com\/eldstal\/kmeans  2018. 1D K-Means Open Source. Retrieved 2018-10-13 from https:\/\/github.com\/eldstal\/kmeans"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750385"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750386"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3151032"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2003-00496-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830823"},{"key":"e_1_3_2_1_9_1","unstructured":"Luca Benini et al. 2002. An adaptive data compression scheme for memory traffic minimization in processor-based systems. In ISCAS. IEEE.  Luca Benini et al. 2002. An adaptive data compression scheme for memory traffic minimization in processor-based systems. In ISCAS. IEEE."},{"volume-title":"FLASH4 User's Guide","author":"ASCF Center","key":"e_1_3_2_1_10_1","unstructured":"ASCF Center . 2018. FLASH4 User's Guide . http:\/\/flash.uchicago.edu\/site\/flashcode\/user_support\/flash4_ug_4p6.pdf Online; Accessed 2019-04-18. ASCF Center. 2018. FLASH4 User's Guide. http:\/\/flash.uchicago.edu\/site\/flashcode\/user_support\/flash4_ug_4p6.pdf Online; Accessed 2019-04-18."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488873"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00051"},{"volume-title":"Fast error-bounded lossy HPC data compression with SZ","author":"Di Sheng","key":"e_1_3_2_1_13_1","unstructured":"Sheng Di and Franck Cappello . 2016. Fast error-bounded lossy HPC data compression with SZ . In IPDPS. IEEE , 730--739. Sheng Di and Franck Cappello. 2016. Fast error-bounded lossy HPC data compression with SZ. In IPDPS. IEEE, 730--739."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2012.44"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944862.1944876"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080695.1069978"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"D. Genbrugge S. Eyerman and L. Eeckhout. 2010. Interval simulation: Raising the level of abstraction in architectural simulation. In HPCA-16. 1--12.  D. Genbrugge S. Eyerman and L. Eeckhout. 2010. Interval simulation: Raising the level of abstraction in architectural simulation. In HPCA-16. 1--12.","DOI":"10.1109\/HPCA.2010.5416636"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186736.1186737"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00034"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Animesh Jain et al. 2016. Concise loads and stores: The case for an asymmetric compute-memory architecture for approximation. In MICRO-49.   Animesh Jain et al. 2016. Concise loads and stores: The case for an asymmetric compute-memory architecture for approximation. In MICRO-49.","DOI":"10.1109\/MICRO.2016.7783744"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926294"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.37"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1669112.1669172"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065034"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. of IEEE 90","author":"Meijering E.","year":"2002","unstructured":"E. Meijering . 2002 . A chronology of interpolation: from ancient astronomy to modern signal and image processing . Proc. of IEEE 90 (2002). E. Meijering. 2002. A chronology of interpolation: from ancient astronomy to modern signal and image processing. Proc. of IEEE 90 (2002)."},{"key":"e_1_3_2_1_27_1","unstructured":"N. Muralimanohar et al. 2009. CACTI 6.0: A tool to model large caches. HP lab. (2009) 22--31.  N. Muralimanohar et al. 2009. CACTI 6.0: A tool to model large caches. HP lab. (2009) 22--31."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3123939.3124545"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243176.3243178"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2011.6114176"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540724"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555815.1555801"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2011.4"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10617-009-9044-4"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993316.1993518"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Joshua San Miguel etal 2014. Load Value Approximation. In MICRO.  Joshua San Miguel et al. 2014. Load Value Approximation. In MICRO.","DOI":"10.1109\/MICRO.2014.22"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"J. San Miguel J. Albericio N. Enright Jerger and A. Jaleel. 2016. The bunker cache for spatio-value approximation. In MICRO-49. IEEE 1--12.   J. San Miguel J. Albericio N. Enright Jerger and A. Jaleel. 2016. The bunker cache for spatio-value approximation. In MICRO-49. IEEE 1--12.","DOI":"10.1109\/MICRO.2016.7783746"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2830772.2830790"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540715"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976740"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370864"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/191995.192072"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"A. Shafiee et al. 2014. MemZip: Exploring unconventional benefits from memory compression. In HPCA. 638--649.  A. Shafiee et al. 2014. MemZip: Exploring unconventional benefits from memory compression. In HPCA. 638--649.","DOI":"10.1109\/HPCA.2014.6835972"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2628071.2628110"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/216585.216588"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2836168"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"A. Yazdanbakhsh et al. 2017. AxBench: A Multiplatform Benchmark Suite for Approximate Computing. IEEE Design & Test 34 2 (2017).  A. Yazdanbakhsh et al. 2017. AxBench: A Multiplatform Benchmark Suite for Approximate Computing. IEEE Design & Test 34 2 (2017).","DOI":"10.1109\/MDAT.2016.2630270"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.53"}],"event":{"name":"ICPP 2019: 48th International Conference on Parallel Processing","sponsor":["University of Tsukuba University of Tsukuba"],"location":"Kyoto Japan","acronym":"ICPP 2019"},"container-title":["Proceedings of the 48th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3337821.3337824","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3337821.3337824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:25Z","timestamp":1750204465000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3337821.3337824"}},"subtitle":["Reducing Memory Traffic with Approximate Value Reconstruction"],"short-title":[],"issued":{"date-parts":[[2019,8,5]]},"references-count":47,"alternative-id":["10.1145\/3337821.3337824","10.1145\/3337821"],"URL":"https:\/\/doi.org\/10.1145\/3337821.3337824","relation":{},"subject":[],"published":{"date-parts":[[2019,8,5]]},"assertion":[{"value":"2019-08-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}