M-CLOCK: Migration-optimized Page Replacement Algorithm for Hybrid Memory Architecture
- Authors
- Lee, M[Lee, Minho]; Kang, DH[Kang, Dong Hyun]; Eom, YI[Eom, Young Ik]
- Issue Date
- Nov-2018
- Publisher
- ASSOC COMPUTING MACHINERY
- Keywords
- Phase change memory; hybrid memory architecture; page replacement algorithm
- Citation
- ACM TRANSACTIONS ON STORAGE, v.14, no.3
- Indexed
- SCIE
SCOPUS
- Journal Title
- ACM TRANSACTIONS ON STORAGE
- Volume
- 14
- Number
- 3
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/17855
- DOI
- 10.1145/3216730
- ISSN
- 1553-3077
- Abstract
- Phase Change Memory (PCM) has drawn great attention as a main memory due to its attractive characteristics such as non-volatility, byte-addressability, and in-place update. However, since the capacity of PCM is not fully mature yet, hybrid memory architecture that consists of DRAM and PCM has been suggested as a main memory. In addition, page replacement algorithm based on hybrid memory architecture is actively being studied, because existing page replacement algorithms cannot be used on hybrid memory architecture in that they do not consider the two weaknesses of PCM: high write latency and low endurance. In this article, to mitigate the above hardware limitations of PCM, we revisit the page cache layer for the hybrid memory architecture and propose a novel page replacement algorithm, called M-CLOCK, to improve the performance of hybrid memory architecture and the lifespan of PCM. In particular, M-CLOCK aims to reduce the number of PCM writes that negatively affect the performance of hybrid memory architecture. Experimental results clearly show that M-CLOCK outperforms the state-of-the-art page replacement algorithms in terms of the number of PCM writes and effective memory access time by up to 98% and 9.4 times, respectively.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Computing and Informatics > Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.