{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T21:10:04Z","timestamp":1745356204745,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348617"},{"type":"electronic","value":"9783642348624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34862-4_5","type":"book-chapter","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T09:00:11Z","timestamp":1353920411000},"page":"67-81","source":"Crossref","is-referenced-by-count":2,"title":["Energy Efficient Caching for Phase-Change Memory"],"prefix":"10.1007","author":[{"given":"Neal","family":"Barcelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cole","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Nugent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Lee, B.C., Ipek, E., Mutlu, O., Burger, D.: Architecting phase change memory as a scalable dram alternative. In: 36th International Symposium on Computer Architecture, ISCA, pp. 2\u201313 (2009)","key":"5_CR1","DOI":"10.1145\/1555754.1555758"},{"doi-asserted-by":"crossref","unstructured":"Li, D., Vetter, J.S., Marin, G., McCurdy, C., Cira, C., Liu, Z., Yu, W.: Identifying opportunities for byte-addressable non-volatile memory in extreme-scale scientific applications. In: 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS, pp. 945\u2013956 (2012)","key":"5_CR2","DOI":"10.1109\/IPDPS.2012.89"},{"doi-asserted-by":"crossref","unstructured":"Zhou, P., Zhao, B., Yang, J., Zhang, Y.: A durable and energy efficient main memory using phase change memory technology. In: 36th International Symposium on Computer Architecture, ISCA, pp. 14\u201323 (2009)","key":"5_CR3","DOI":"10.1145\/1555754.1555759"},{"doi-asserted-by":"crossref","unstructured":"Qureshi, M.K., Karidis, J.P., Franceschini, M., Srinivasan, V., Lastras, L., Abali, B.: Enhancing lifetime and security of pcm-based main memory with start-gap wear leveling. In: 42nd Annual IEEE\/ACM International Symposium on Microarchitecture, MICRO, pp. 14\u201323 (2009)","key":"5_CR4","DOI":"10.1145\/1669112.1669117"},{"doi-asserted-by":"crossref","unstructured":"Cho, S., Lee, H.: Flip-n-write: a simple deterministic technique to improve pram write performance, energy and endurance. In: 42nd Annual IEEE\/ACM International Symposium on Microarchitecture, MICRO, pp. 347\u2013357 (2009)","key":"5_CR5","DOI":"10.1145\/1669112.1669157"},{"doi-asserted-by":"crossref","unstructured":"Ferreira, A.P., Zhou, M., Bock, S., Childers, B.R., Melhem, R.G., Moss\u00e9, D.: Increasing pcm main memory lifetime. In: Design, Automation and Test in Europe, DATE, pp. 914\u2013919 (2010)","key":"5_CR6","DOI":"10.1109\/DATE.2010.5456923"},{"unstructured":"Chen, S., Gibbons, P.B., Nath, S.: Rethinking database algorithms for phase change memory. In: Fifth Biennial Conference on Innovative Data Systems Research, CIDR, pp. 21\u201331 (2011)","key":"5_CR7"},{"doi-asserted-by":"crossref","unstructured":"Ferreira, A.P., Childers, B.R., Melhem, R.G., Moss\u00e9, D., Yousif, M.: Using pcm in next-generation embedded space applications. In: IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS, pp. 153\u2013162 (2010)","key":"5_CR8","DOI":"10.1109\/RTAS.2010.40"},{"doi-asserted-by":"crossref","unstructured":"Qureshi, M.K., Srinivasan, V., Rivers, J.A.: Scalable high performance main memory system using phase-change memory technology. In: 36th International Symposium on Computer Architecture, ISCA, pp. 24\u201333 (2009)","key":"5_CR9","DOI":"10.1145\/1555754.1555760"},{"doi-asserted-by":"crossref","unstructured":"Hay, A., Strauss, K., Sherwood, T., Loh, G.H., Burger, D.: Preventing pcm banks from seizing too much power. In: 44th Annual IEEE\/ACM International Symposium on Microarchitecture, MICRO, pp. 186\u2013195 (2011)","key":"5_CR10","DOI":"10.1145\/2155620.2155642"},{"unstructured":"Young, N.E.: On-line file caching. In: Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 82\u201386 (1998)","key":"5_CR11"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-15775-2_17","volume-title":"Algorithms \u2013 ESA 2010","author":"M. Chrobak","year":"2010","unstructured":"Chrobak, M., Woeginger, G.J., Makino, K., Xu, H.: Caching Is Hard \u2013 Even in the Fault Model. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 195\u2013206. Springer, Heidelberg (2010)"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. J. Algorithms\u00a012(4), 685\u2013699 (1991)","journal-title":"J. Algorithms"},{"issue":"6","key":"5_CR14","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L.A. McGeoch","year":"1991","unstructured":"McGeoch, L.A., Sleator, D.D.: A strongly competitive randomized paging algorithm. Algorithmica\u00a06(6), 816\u2013825 (1991)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Bansal, N., Buchbinder, N., Naor, J.: Randomized competitive algorithms for generalized caching. In: 40th Annual ACM Symposium on Theory of Computing, STOC, pp. 235\u2013244 (2008)","key":"5_CR15","DOI":"10.1145\/1374376.1374412"},{"doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Czumaj, A., Englert, M., R\u00e4cke, H.: An o(log k)-competitive algorithm for generalized caching. In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1681\u20131689 (2012)","key":"5_CR16","DOI":"10.1137\/1.9781611973099.133"},{"doi-asserted-by":"crossref","unstructured":"Park, S.Y., Jung, D., Kang, J.U., Kim, J., Lee, J.: Cflru: a replacement algorithm for flash memory. In: International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES, pp. 234\u2013241 (2006)","key":"5_CR17","DOI":"10.1145\/1176760.1176789"},{"doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update rules. In: 16th Annual ACM Symposium on Theory of Computing, STOC, pp. 488\u2013492 (1984)","key":"5_CR18","DOI":"10.1145\/800057.808718"},{"doi-asserted-by":"crossref","unstructured":"Joo, Y., Niu, D., Dong, X., Sun, G., Chang, N., Xie, Y.: Energy- and endurance-aware design of phase change memory caches. In: Design, Automation and Test in Europe, DATE, pp. 136\u2013141 (2010)","key":"5_CR19","DOI":"10.1109\/DATE.2010.5457221"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/2.982916","volume":"35","author":"P.S. Magnusson","year":"2002","unstructured":"Magnusson, P.S., Christensson, M., Eskilson, J., Forsgren, D., H\u00e5llberg, G., H\u00f6gberg, J., Larsson, F., Moestedt, A., Werner, B.: Simics: A full system simulation platform. Computer\u00a035, 50\u201358 (2002)","journal-title":"Computer"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186736.1186737","volume":"34","author":"J.L. Henning","year":"2006","unstructured":"Henning, J.L.: Spec cpu 2006 benchmark descriptions. SIGARCH Comput. Archit. News\u00a034, 1\u201317 (2006)","journal-title":"SIGARCH Comput. Archit. News"}],"container-title":["Lecture Notes in Computer Science","Design and Analysis of Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34862-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T20:38:48Z","timestamp":1745354328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34862-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348617","9783642348624"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34862-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}