%0 Conference Proceedings
%T APP-LRU: A New Page Replacement Method for PCM/DRAM-Based Hybrid Memory Systems
%+ University of Science and Technology of China [Hefei] (USTC)
%+ Chinese Academy of Sciences [Beijing] (CAS)
%A Wu, Zhangling
%A Jin, Peiquan
%A Yang, Chengcheng
%A Yue, Lihua
%Z Part 1: Systems, Networks and Architectures
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th IFIP International Conference on Network and Parallel Computing (NPC)
%C Ilan, Taiwan
%Y Ching-Hsien Hsu
%Y Xuanhua Shi
%Y Valentina Salapura
%I Springer
%3 Network and Parallel Computing
%V LNCS-8707
%P 84-95
%8 2014-09-18
%D 2014
%R 10.1007/978-3-662-44917-2_8
%K Phase change memory
%K Page replacement policy
%K Hybrid memory
%Z Computer Science [cs]Conference papers
%X Phase change memory (PCM) has become one of the most promising storage media particularly for memory systems, due to its byte addressability, high access speed, and low energy consumption. In addition, hybrid memory systems involving both PCM and DRAM can utilize the merits of both media and overcome some typical drawbacks of PCM such as high write latency and limited lifecycle. In this paper, we present a novel page replacement algorithm called APP-LRU (Access-Pattern-prediction-based LRU) for PCM/DRAM-based hybrid memory systems. APP-LRU aims to reduce writes to PCM while maintaining stable time performance. Particularly, we detect read/write intensity for each page in the memory, and put read-intensive pages into PCM while placing write-intensive pages in DRAM. We conduct trace-driven experiments on six synthetic traces and one real OLTP trace. The results show that our proposal is able to reduce up to 5 times of migrations more than its competitors.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01403068/document
%2 https://inria.hal.science/hal-01403068/file/978-3-662-44917-2_8_Chapter.pdf
%L hal-01403068
%U https://inria.hal.science/hal-01403068
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-LNCS-8707
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3