Abstract
This paper presents new page replacement algorithms for NAND flash memory, called CFLRU/C, CFLRU/E, and DL-CFLRU/E. The algorithms aim at reducing the number of erase operations and improving the wear-leveling degree of flash memory. In the CFLRU/C and CFLRU/E algorithms, the least recently used clean page is selected as the victim within the pre-specified window of the LRU list. If there is no clean page within the window, CFLRU/C evicts the dirty page with the lowest access frequency while CFLRU/E evicts the dirty page with the lowest block erase count. DL-CFLRU/E maintains two LRU lists called the clean page list and the dirty page list, and first evicts a page from the clean page list. If there is no clean page in the clean page list, DL-CFLRU/E evicts the dirty page with the lowest block erase count within the window of the dirty page list. Experiments through simulation studies show that the proposed algorithms reduce the number of erase operations and improve the wear-leveling degree of flash memory compared to LRU and CFLRU.
This work was supported in part by the Samsung Electronics, and by the Korea Research Foundation Grant funded by Korean Government(MOEHRD) (R08-2004-000-10391-0).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Yoo, Y., Han, L., Ryu, Y.: Performance Evaluation of LRU Replacement Algorithm for Flash-based Cache System. In: Proceedings of Korean Mobile Society Spring Conference (2006)
Yoo, Y., Ryu, Y.: Performance Evaluation of Buffer Replacement Algorithm for Flash Memory. In: Proceeding of Korean Mobile Society Fall Conference (2006)
Yoo, Y., Ryu, Y.: A Buffer Replacement Algorithm for Flash Memory. 2006 Myongji IT forum (2006)
Yang, H., Han, L., Yoo, Y., Lim, D., Ryu, Y.S.: Design of Multimedia File System on Flash Memory Storage. In: Proceedings of Korea Multimedia Society Fall Conference (2005)
Han, L., Ryu, Y.: Performance Comparison of File Systems on Flash Disk and Hard Disk. In: Proceedings of Korea Multimedia Society Fall Conference (2004)
Douglis, F., Caceres, R., Kaashoek, F., Li, K., Marsh, B., Tauber, J.A.: Storage Alternatives for Mobile Computers. In: Proceedings of the 1st Symposium on Operating System Design and Implementation (1994)
Park, C., Kang, J., Park, S., Kim, J.: Energy-Aware Demand Paging on NAND Flash-based Embedded Storages. In: Proceedings of International Symposium on Low Power Electronics and Design (2004)
Park, S., Jung, D., Kang, J., Kim, J., Lee, J.: CFLRU: a replacement algorithm for flash memory. In: Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems (2006)
Park, C., et al.: A low-cost memory architecture with NAND XIP for mobile embedded systems. In: Proceedings of CODES+ISSS (2003)
Samsung Electronics, NAND flash memory data sheets (2003)
Ryu, Y., Lee, K.: Improvement of Space Utilization in NAND Flash Memory Storages, Lecture Notes in Computer Science (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoo, YS., Lee, H., Ryu, Y., Bahn, H. (2007). Page Replacement Algorithms for NAND Flash Memory Storages. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)