{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T09:33:31Z","timestamp":1768296811167,"version":"3.49.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030935702","type":"print"},{"value":"9783030935719","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-93571-9_10","type":"book-chapter","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T11:02:52Z","timestamp":1642071772000},"page":"118-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Buffering Scheme for PCM\/DRAM-Based Hybrid Memory Architecture"],"prefix":"10.1007","author":[{"given":"Xiaoliang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaimeng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peiquan","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Liu, R., Jin, P., et al.: Efficient wear leveling for PCM\/DRAM-based hybrid memory. In: HPCC, pp. 1979\u20131986 (2019)","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00273"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1109\/TCSII.2021.3049716","volume":"68","author":"H Pozidis","year":"2021","unstructured":"Pozidis, H., Papandreou, N., et al.: Circuit and system-level aspects of phase change memory. IEEE Trans. Circuits Syst. II Express Briefs 68(3), 844\u2013850 (2021)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"10_CR3","unstructured":"Jin, P., Wu, Z., et al.: A page-based storage framework for phase change memory. In: MSST, pp. 1\u201312 (2017)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Dhiman, G., Ayoub, R., et al.: PDRAM: a hybrid PRAM and DRAM main memory system. In: DAC, pp. 664\u2013669 (2009)","DOI":"10.1145\/1629911.1630086"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/bs.adcom.2019.09.002","volume":"118","author":"M Asadinia","year":"2020","unstructured":"Asadinia, M., Sarbazi-Azad, H.: The emerging phase change memory. Adv. Comput. 118, 15\u201328 (2020)","journal-title":"Adv. Comput."},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s11390-015-1509-2","volume":"30","author":"F Xia","year":"2015","unstructured":"Xia, F., Jiang, D., et al.: A survey of phase change memory systems. J. Comput. Sci. Technol. 30(1), 121\u2013144 (2015)","journal-title":"J. Comput. Sci. Technol."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-79478-1_21","volume-title":"Network and Parallel Computing","author":"Y Fu","year":"2021","unstructured":"Fu, Y., Wu, Y.: CARAM: a content-aware hybrid PCM\/DRAM main memory system framework. In: He, X., Shao, E., Tan, G. (eds.) NPC 2020. LNCS, vol. 12639, pp. 243\u2013248. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79478-1_21"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, D., Jin, P., et al.: DPHSim: a flexible simulator for DRAM\/PCM-based hybrid memory. In: APWeb\/WAIM, pp. 319\u2013323 (2017)","DOI":"10.1007\/978-3-319-63564-4_27"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/1994.2022","volume":"9","author":"W Effelsberg","year":"1984","unstructured":"Effelsberg, W., Haerder, T.: Principles of database buffer management. ACM Trans. Database Syst. 9(4), 560\u2013595 (1984)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/2107756.2107760","volume":"11","author":"H Seok","year":"2011","unstructured":"Seok, H., Park, Y., Park, K.W., et al.: Efficient page caching algorithm with prediction and migration for a hybrid main memory. ACM SIGAPP Appl. Comput. Rev. 11(4), 38\u201348 (2011)","journal-title":"ACM SIGAPP Appl. Comput. Rev."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-662-44917-2_10","volume-title":"Network and Parallel Computing","author":"K Chen","year":"2014","unstructured":"Chen, K., Jin, P., Yue, L.: A novel page replacement algorithm for the hybrid memory architecture involving PCM and DRAM. In: Hsu, C.-H., Shi, X., Salapura, V. (eds.) NPC 2014. LNCS, vol. 8707, pp. 108\u2013119. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44917-2_10"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-662-44917-2_8","volume-title":"Network and Parallel Computing","author":"Z Wu","year":"2014","unstructured":"Wu, Z., Jin, P., Yang, C., Yue, L.: APP-LRU: a new page replacement method for PCM\/DRAM-based hybrid memory systems. In: Hsu, C.-H., Shi, X., Salapura, V. (eds.) NPC 2014. LNCS, vol. 8707, pp. 84\u201395. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44917-2_8"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Chen, K., Jin, P., Yue, L.: Efficient buffer management for PCM-enhanced hybrid memory architecture. In: APWeb, pp. 29\u201340 (2015)","DOI":"10.1007\/978-3-319-25255-1_3"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Wang, H., Shen, Z., et al.: CLOCK-RWRF: a read-write-relative-frequency page replacement algorithm for PCM and DRAM of hybrid memory. In: HPCC, pp. 189\u2013196 (2020)","DOI":"10.1109\/HPCC-SmartCity-DSS50907.2020.00024"},{"issue":"9","key":"10_CR15","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1109\/TC.2013.98","volume":"63","author":"S Lee","year":"2014","unstructured":"Lee, S., Bahn, B., et al.: CLOCK-DWF: a write-history-aware page replacement algorithm for hybrid PCM and DRAM memory architectures. IEEE Trans. Comput. 63(9), 2187\u20132220 (2014)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Lee, E., Bahn, H.: Caching strategies for high-performance storage media. ACM Trans. Storage 10(3), 11:1\u201311:22 (2014)","DOI":"10.1145\/2633691"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.datak.2011.09.007","volume":"72","author":"P Jin","year":"2012","unstructured":"Jin, P., Ou, Y., et al.: AD-LRU: an efficient buffer replacement algorithm for flash-based databases. Data Knowl. Eng. 72, 83\u2013102 (2012)","journal-title":"Data Knowl. Eng."}],"container-title":["Lecture Notes in Computer Science","Network and Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93571-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:02:34Z","timestamp":1768266154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93571-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030935702","9783030935719"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93571-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Network and Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"npc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/npc2021.dnac.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}