Development of Flash Memory Page Management Techniques

Jeong-Joon Kim
Volume: 14, No: 3, Page: 631 ~ 644, Year: 2018
10.3745/JIPS.04.0073
Keywords: Flash Memory, Page Replacement Algorithm, SSD
Full Text:

Abstract
Many studies on flash memory-based buffer replacement algorithms that consider the characteristics of flash memory have recently been developed. Conventional flash memory-based buffer replacement algorithms have the disadvantage that the operation speed slows down, because only the reference is checked when selecting a replacement target page and either the reference count is not considered, or when the reference time is considered, the elapsed time is considered. Therefore, this paper seeks to solve the problem of conventional flash memory-based buffer replacement algorithm by dividing pages into groups and considering the reference frequency and reference time when selecting the replacement target page. In addition, because flash memory has a limited lifespan, candidates for replacement pages are selected based on the number of deletions.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
Jeong-Joon Kim, "Development of Flash Memory Page Management Techniques," Journal of Information Processing Systems, vol. 14, no. 3, pp. 631~644, 2018. DOI: 10.3745/JIPS.04.0073.

ACM Style
Jeong-Joon Kim, "Development of Flash Memory Page Management Techniques," Journal of Information Processing Systems, 14, 3, (2018), 631~644. DOI: 10.3745/JIPS.04.0073.