.png){kind=icon}
.png){kind=icon}
Return
Page Replacement Algorithm Based on Counting Bloom Filter for NAND Flash Memory
.png){kind=icon}
PRE
AI
DOI：10.1109/TCE.2014.7027337.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a page replacement algorithm based on counting bloom filter for NAND flash memory is proposed. This algorithm mainly consists of two schemes: the data separation scheme based on counting bloom filter and the free block management scheme. The former is used for classifying the dirty subpages within the victim pages as hot or cold and the latter is used for classifying the free blocks within the free block list into young or old. Moreover, in order to improve the performance of NAND flash memory, the hot dirty subpages are written back to the young free block, and the cold subpages are distributed to the old free block. Experimental results show that the proposed algorithm performs better than the existing page replacement algorithms in terms of the number of write operations, the total runtime, the buffer hit ratio and the degree of wear leveling(1).
Keywords:
Counting Bloom Filter
Subpaging
Page Replacement Algorithm
Flash Memory
Data Separation Scheme
Block Management Scheme
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.9
Papers:
5.1K
Citations:
6.8K