{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:38Z","timestamp":1750308578594,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T00:00:00Z","timestamp":1506902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation at Lehigh University","award":["CCF-1253362"],"award-info":[{"award-number":["CCF-1253362"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,2]]},"DOI":"10.1145\/3132402.3132438","type":"proceedings-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T12:51:09Z","timestamp":1507812669000},"page":"127-129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A study of unnecessary write backs"],"prefix":"10.1145","author":[{"given":"Christopher","family":"Garman","sequence":"first","affiliation":[{"name":"Lehigh University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochen","family":"Guo","sequence":"additional","affiliation":[{"name":"Lehigh University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Spear","sequence":"additional","affiliation":[{"name":"Lehigh University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,10,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"e_1_3_2_1_2_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. {n. d.}. Introduction to Algorithms (2nd ed). MIT Press and McGraw-Hill.   T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. {n. d.}. Introduction to Algorithms (2nd ed). MIT Press and McGraw-Hill."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/30.11.2478"},{"key":"e_1_3_2_1_4_1","unstructured":"Everspin Technology. 2015. DDR3 DRAM Compatible MRAM - Spin Torque Technology. (2015). http:\/\/www.everspin.com\/ddr3-dram-compatible-mram-spin-torque-technology.  Everspin Technology. 2015. DDR3 DRAM Compatible MRAM - Spin Torque Technology. (2015). http:\/\/www.everspin.com\/ddr3-dram-compatible-mram-spin-torque-technology."},{"key":"e_1_3_2_1_5_1","unstructured":"J. Funston. 2017. MultiCacheSim. (2017). https:\/\/github.com\/jfunston\/MultiCacheSim.  J. Funston. 2017. MultiCacheSim. (2017). https:\/\/github.com\/jfunston\/MultiCacheSim."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2989081.2989122"},{"key":"e_1_3_2_1_7_1","unstructured":"Intel Corporation. 2016. 3D XPoint\u2122 Unveiled---The Next Breakthrough in Memory Technology. (2016). http:\/\/www.intel.com\/content\/www\/us\/en\/architecture-and-technology\/3d-xpoint-unveiled-video.html.  Intel Corporation. 2016. 3D XPoint \u2122 Unveiled---The Next Breakthrough in Memory Technology. (2016). http:\/\/www.intel.com\/content\/www\/us\/en\/architecture-and-technology\/3d-xpoint-unveiled-video.html."},{"volume-title":"Partial Row Activation for Low-Power DRAM System. In 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA). 217--228","author":"Lee Y.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.462.0187"},{"volume-title":"Circuits and Systems (MWS-CAS), 2013 IEEE 56th International Midwest Symposium on. 469--472","author":"Mishra P.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","unstructured":"Samsung. 2014. Samsung V-NAND technology. (2014). http:\/\/www.samsung.com\/us\/business\/oem-solutions\/pdfs\/V-NAND_technology_WP.pdf.  Samsung. 2014. Samsung V-NAND technology. (2014). http:\/\/www.samsung.com\/us\/business\/oem-solutions\/pdfs\/V-NAND_technology_WP.pdf."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"F. K. Soong and E. F. Huang. 1991. A tree-trellis based fast search for finding the N-best sentence hypotheses in continuous speech recognition. In {Proceedings} ICASSP 91: 1991 International Conference on Acoustics Speech and Signal Processing. 705--708 vol.1.   F. K. Soong and E. F. Huang. 1991. A tree-trellis based fast search for finding the N-best sentence hypotheses in continuous speech recognition. In {Proceedings} ICASSP 91: 1991 International Conference on Acoustics Speech and Signal Processing. 705--708 vol.1.","DOI":"10.1109\/ICASSP.1991.150437"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2012.2190369"}],"event":{"name":"MEMSYS 2017: The International Symposium on Memory Systems, 2017","acronym":"MEMSYS 2017","location":"Alexandria Virginia"},"container-title":["Proceedings of the International Symposium on Memory Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132402.3132438","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3132402.3132438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:56Z","timestamp":1750273496000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132402.3132438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,2]]},"references-count":15,"alternative-id":["10.1145\/3132402.3132438","10.1145\/3132402"],"URL":"https:\/\/doi.org\/10.1145\/3132402.3132438","relation":{},"subject":[],"published":{"date-parts":[[2017,10,2]]},"assertion":[{"value":"2017-10-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}