An Efficient Buffer Replacement Policy based on CLOCK Algorithm for NAND Flash Memory


The KIPS Transactions:PartD, Vol. 16, No. 6, pp. 825-834, Dec. 2009
10.3745/KIPSTD.2009.16.6.825,   PDF Download:

Abstract

Recently, NAND flash memory has been popular for a next-generation storage device because of its rapid access speed, low-power consumption, shock-resistant. However, unlike a disk based storage device, it has distinct characteristics such as the asymmetric cost of read, write and erase operation, and no in-place update. thus, disk based buffer management policies may not yield a good performance on NAND flash memory based system. To solve this problem, flash-aware buffer management policies which consider the characteristics of NAND flash memory have been proposed. In this paper, we propose a novel flash-aware buffer replacement olicy called CLOCK-NAND that is an enhancement of the well-known disk-based buffer replacement policy, CLOCK-Pro. Although CLOCK-NAND is basically based on the algorithm of CLOCK-Pro, it exploits a new hot page change policy to use page access information efficiently. Also, it delays write operation for dirty and hot page by using cold change delay policy and it yield a good performance on NAND flash memory according to these new policies.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Kim, J. H. Son, D. H. Lee, "An Efficient Buffer Replacement Policy based on CLOCK Algorithm for NAND Flash Memory," The KIPS Transactions:PartD, vol. 16, no. 6, pp. 825-834, 2009. DOI: 10.3745/KIPSTD.2009.16.6.825.

[ACM Style]
Jong Sun Kim, Jin Hyun Son, and Dong Ho Lee. 2009. An Efficient Buffer Replacement Policy based on CLOCK Algorithm for NAND Flash Memory. The KIPS Transactions:PartD, 16, 6, (2009), 825-834. DOI: 10.3745/KIPSTD.2009.16.6.825.