Page replacement for write references in NAND flash based virtual memory systems

Hyejeong Lee, Hyokyung Bahn, Kang G. Shin

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


Contemporary embedded systems often use NAND flash memory instead of hard disks as their swap space of virtual memory. Since the read/write characteristics of NAND flash memory are very different from those of hard disks, an efficient page replacement algorithm is needed for this environment. Our analysis shows that temporal locality is dominant in virtual memory references but that is not the case for write references, when the read and write references are monitored separately. Based on this observation, we present a new page replacement algorithm that uses different strategies for read and write operations in predicting the re-reference likelihood of pages. For read operations, only temporal locality is used; but for write operations, both write frequency and temporal locality are used. The algorithm logically partitions the memory space into read and write areas to keep track of their reference patterns precisely, and then dynamically adjusts their size based on their reference patterns and I/O costs. Without requiring any external parameter to tune, the proposed algorithm outperforms CLOCK, CAR, and CFLRU by 20%-66%. It also supports optimized implementations for virtual memory systems.

Original languageEnglish
Pages (from-to)157-172
Number of pages16
JournalJournal of Computing Science and Engineering
Issue number3
StatePublished - 2014

Bibliographical note

Publisher Copyright:
© 2014. The Korean Institute of Information Scientists and Engineers.


  • Flash memory
  • Memory
  • Secondary storage
  • Storage hierarchies
  • Swapping
  • Virtual memory


Dive into the research topics of 'Page replacement for write references in NAND flash based virtual memory systems'. Together they form a unique fingerprint.

Cite this