CFLRU: a replacement algorithm for flash memory

  • Authors:

  • Seon-yeong Park;Dawoon Jung;Jeong-uk Kang;Jin-soo Kim;Joonwon Lee

  • Affiliations:

  • Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea;Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea;Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea;Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea;Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea

  • Venue:
  • CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In most operating systems which are customized for disk-based storage system, the replacement algorithm concerns only the number of memory hits. However, flash memory has different read and write cost in the aspects of time and energy so the replacement algorithm with flash memory should consider not only the hit count but also the replacement cost caused by selecting dirty victims. The replacement cost of dirty page is higher than that of clean page with regard to both access time and energy consumption. In this paper, we propose the Clean-First LRU (CFLRU) replacement algorithm that exploits the characteristics of flash memory. CFLRU splits the LRU list into the working region and the clean-first region and adopts a policy that evicts clean pages preferentially in the clean-first region until the number of page hits in the working region is preserved in a suitable level. Using the trace-driven simulation, the proposed algorithm reduces the average replacement cost by 28.4% in swap system and by 26.2% in buffer cache, compared with LRU algorithm. We also implement the CFLRU algorithm in the Linux kernel and present some optimization issues.