The Design and Implementation of a Cleaning Algorithm using NAND-Type Flash Memory

Yong-Wan Koo; Dae-Man Han

The Design and Implementation of a Cleaning Algorithm using NAND-Type Flash Memory

Yong-Wan Koo, Dae-Man Han, Journal of Internet Computing and Services, Vol. 7, No. 6, pp. 105-112, Dec. 2006
Full Text:

Keywords: Flash, File System, Embedded

Abstract

This paper be composed to file system by making a new i_node structure which can decrease Write frequency because this's can improved the file system efficiency if reduced Write operation frequency of flash memory in respect of file system, i-node is designed to realize Cleaning policy of data in order to perform Write operation. This paper suggest Cleaning Algorithm for Write operation through a new i_node structure. In addition, this paper have mode the oldest data cleaned and the most recent data maintained longest as a result of experiment that the recent applied program and data tend to be implemented again through the concept of regional and time space which appears automatically when applied program is implemented. Through experiment and realization of the Flash file system, this paper proved the efficiency of NAND-type flash file system which is required in on Embedded system.

Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from November 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

[APA Style]

Koo, Y. & Han, D. (2006). The Design and Implementation of a Cleaning Algorithm using NAND-Type Flash Memory. Journal of Internet Computing and Services, 7(6), 105-112.

[IEEE Style]

Y. Koo and D. Han, "The Design and Implementation of a Cleaning Algorithm using NAND-Type Flash Memory," Journal of Internet Computing and Services, vol. 7, no. 6, pp. 105-112, 2006.

[ACM Style]

Yong-Wan Koo and Dae-Man Han. 2006. The Design and Implementation of a Cleaning Algorithm using NAND-Type Flash Memory. Journal of Internet Computing and Services, 7, 6, (2006), 105-112.