.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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).
Keyword:
Counting Bloom Filter
Subpaging
Page Replacement Algorithm
Flash Memory
Data Separation Scheme
Block Management Scheme
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.9
论文数:
5.3K
被引数:
6.8K
机构
引用论文
Phosphorus- and nitrogen-co-doped particleboard based activated carbon in supercapacitor application.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏分享收藏
查看更多内容