{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:09Z","timestamp":1750220829579,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T00:00:00Z","timestamp":1570579200000},"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,10,9]]},"DOI":"10.1145\/3359986.3361209","type":"proceedings-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T12:21:06Z","timestamp":1570450866000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate computing for multithreaded programs in shared memory architectures"],"prefix":"10.1145","author":[{"given":"Bernard","family":"Nongpoh","sequence":"first","affiliation":[{"name":"National Institute of Technology Meghalaya, Shillong, Meghalaya, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajarshi","family":"Ray","sequence":"additional","affiliation":[{"name":"Indian Association for the Cultivation of Science, Kolkata, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ansuman","family":"Banerjee","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,10,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Overcoming the Data-flow Limit on Parallelism with Structural Approximation. In WAX","author":"Balaji Vignesh","year":"2016","unstructured":"Vignesh Balaji. 2016. Overcoming the Data-flow Limit on Parallelism with Structural Approximation. In WAX 2016."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941487.1941507"},{"key":"e_1_3_2_1_3_1","unstructured":"Trevor Carlson. 2014. Addressing the simulation challenges of multi-threaded workloads. https:\/\/www.sics.se\/sites\/default\/files\/pub\/sics.se\/trevor_carlson_addressing_the_simulation_challenges_of_multi-threaded_workloads.pdf"},{"key":"e_1_3_2_1_4_1","volume-title":"Article 5","author":"Carlson Trevor E.","year":"2014","unstructured":"Trevor E. Carlson, Wim Heirman, Stijn Eyerman, Ibrahim Hur, and Lieven Eeckhout. 2014. An Evaluation of High-Level Mechanistic Core Models. TACO, Article 5 (2014)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/320385.320386"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2248487.2151008"},{"key":"e_1_3_2_1_7_1","volume-title":"Neural Acceleration for General-Purpose Approximate Programs. In MICRO","author":"Esmaeilzadeh Hadi","year":"2012","unstructured":"Hadi Esmaeilzadeh, Adrian Sampson, Luis Ceze, and Doug Burger. 2012. Neural Acceleration for General-Purpose Approximate Programs. In MICRO 2012. IEEE Computer Society, 449--460."},{"key":"e_1_3_2_1_8_1","volume-title":"Patterson","author":"Hennessy John L.","year":"2011","unstructured":"John L. Hennessy and David A. Patterson. 2011. Computer Architecture, Fifth Edition: A Quantitative Approach (5th ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"J. Huang. 2016. Scalable Thread Sharing Analysis. In ICSE. 1097--1108.","DOI":"10.1145\/2884781.2884811"},{"key":"e_1_3_2_1_10_1","first-page":"9","article-title":"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs","volume":"28","author":"Lamport L.","year":"1979","unstructured":"L. Lamport. 1979. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs. IEEE TC 28, 9 (Sept. 1979), 690--691.","journal-title":"IEEE TC"},{"key":"e_1_3_2_1_11_1","first-page":"3","article-title":"Flikker","volume":"46","author":"Liu Song","year":"2011","unstructured":"Song Liu, Karthik Pattabiraman, Thomas Moscibroda, and Benjamin G. Zorn. 2011. Flikker: Saving DRAM Refresh-power Through Critical Data Partitioning. SIGPLAN Not. 46, 3 (March 2011), 213--224.","journal-title":"Saving DRAM Refresh-power Through Critical Data Partitioning. SIGPLAN Not."},{"key":"e_1_3_2_1_12_1","first-page":"7","article-title":"Why On-chip Cache Coherence is Here to","volume":"55","author":"Martin Milo M. K.","year":"2012","unstructured":"Milo M. K. Martin, Mark D. Hill, and Daniel J. Sorin. 2012. Why On-chip Cache Coherence is Here to Stay. Commun. ACM 55, 7 (July 2012), 78--89.","journal-title":"Stay. Commun. ACM"},{"volume-title":"Readings in Computer Architecture","author":"Moore Gordon E.","key":"e_1_3_2_1_13_1","unstructured":"Gordon E. Moore. 2000. Readings in Computer Architecture. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, Chapter Cramming More Components Onto Integrated Circuits, 56--59."},{"key":"e_1_3_2_1_14_1","volume-title":"Article 26 (Feb.","author":"Nongpoh Bernard","year":"2019","unstructured":"Bernard Nongpoh, Rajarshi Ray, Moumita Das, and Ansuman Banerjee. 2019. Enhancing Speculative Execution With Selective Approximate Computing. ACM TODAES 24, 2, Article 26 (Feb. 2019), 29 pages."},{"key":"e_1_3_2_1_15_1","first-page":"12","article-title":"AutoSense: A Framework for Automated Sensitivity Analysis of Program Data","volume":"43","author":"Nongpoh B.","year":"2017","unstructured":"B. Nongpoh, R. Ray, S. Dutta, and A. Banerjee. 2017. AutoSense: A Framework for Automated Sensitivity Analysis of Program Data. IEEE TSE 43, 12 (Dec 2017), 1110--1124.","journal-title":"IEEE TSE"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2604001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12045-017-0580-0"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"P. V. Rengasamy A. Sivasubramaniam M. T. Kandemir and C. R. Das. 2015. Exploiting Staleness for Approximating Loads on CMPs. In PACT. 343--354.","DOI":"10.1109\/PACT.2015.27"},{"key":"e_1_3_2_1_19_1","volume-title":"Probabilistic Accuracy Bounds for Fault-tolerant Computations That Discard Tasks (ICS '06)","author":"Rinard Martin","year":"2006","unstructured":"Martin Rinard. 2006. Probabilistic Accuracy Bounds for Fault-tolerant Computations That Discard Tasks (ICS '06). ACM, New York, NY, USA, 324--334."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297105.1297055"},{"key":"e_1_3_2_1_21_1","first-page":"5","article-title":"ASAC","volume":"49","author":"Roy Pooja","year":"2014","unstructured":"Pooja Roy, Rajarshi Ray, Chundong Wang, and Weng Fai Wong. 2014. ASAC: Automatic Sensitivity Analysis for Approximate Computing. SIGPLAN Not. 49, 5 (June 2014), 95--104.","journal-title":"Automatic Sensitivity Analysis for Approximate Computing. SIGPLAN Not."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"C. Sakalis C. Leonardsson S. Kaxiras and A. Ros. 2016. Splash-3: A properly synchronized benchmark suite for contemporary research. In ISPASS. 101--111.","DOI":"10.1109\/ISPASS.2016.7482078"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993518"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Sidiroglou-Douskos et al. 2011. Managing Performance vs. Accuracy Trade-offs with Loop Perforation. In ESSC\/FSE. 124--134.","DOI":"10.1145\/2025113.2025133"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/891382"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"M. Sjalander N. S. Nilsson and S. Kaxiras. 2014. A tunable cache for approximate computing. In NANOARCH. 88--89.","DOI":"10.1109\/NANOARCH.2014.6880480"},{"key":"e_1_3_2_1_27_1","volume-title":"Wood","author":"Sorin Daniel J.","year":"2011","unstructured":"Daniel J. Sorin, Mark D. Hill, and David A. Wood. 2011. A Primer on Memory Consistency and Cache Coherence (1st ed.). Morgan & Claypool Publishers."},{"volume-title":"2016 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO). 182--193","author":"Vassiliadis V.","key":"e_1_3_2_1_29_1","unstructured":"V. Vassiliadis, J. Riehme, J. Deussen, K. Parasyris, C. D. Antonopoulos, N. Bellas, S. Lalis, and U. Naumann. 2016. Towards automatic significance analysis for approximate computing. In 2016 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO). 182--193."},{"key":"e_1_3_2_1_30_1","volume-title":"Sequential Tests of Statistical Hypotheses. Ann. Math. Statist. 16, 2 (06","author":"Wald A.","year":"1945","unstructured":"A. Wald. 1945. Sequential Tests of Statistical Hypotheses. Ann. Math. Statist. 16, 2 (06 1945), 117--186."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/320385.320400"},{"key":"e_1_3_2_1_32_1","volume-title":"Jaswinder Pal Singh, and Anoop Gupta","author":"Woo Steven Cameron","year":"1995","unstructured":"Steven Cameron Woo, Moriyoshi Ohara, Evan Torrie, Jaswinder Pal Singh, and Anoop Gupta. 1995. The SPLASH-2 Programs: Characterization and Methodological Considerations (ISCA '95). ACM, New York, NY, USA, 24--36."}],"event":{"name":"MEMOCODE '19: 17th ACM-IEEE International Conference on Formal Methods and Models for System Design","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems","SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA"],"location":"La Jolla California","acronym":"MEMOCODE '19"},"container-title":["Proceedings of the 17th ACM-IEEE International Conference on Formal Methods and Models for System Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359986.3361209","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3359986.3361209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:27Z","timestamp":1750202007000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359986.3361209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,9]]},"references-count":31,"alternative-id":["10.1145\/3359986.3361209","10.1145\/3359986"],"URL":"https:\/\/doi.org\/10.1145\/3359986.3361209","relation":{},"subject":[],"published":{"date-parts":[[2019,10,9]]},"assertion":[{"value":"2019-10-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}