首页 | 本学科首页   官方微博 | 高级检索  
     

基于权重堆排序的NAND Flash静态磨损均衡机制
引用本文:刘彦,徐骥龙,祝磊.基于权重堆排序的NAND Flash静态磨损均衡机制[J].计算机工程与科学,2019,41(2):207-213.
作者姓名:刘彦  徐骥龙  祝磊
作者单位:湖南大学信息科学与工程学院,湖南 长沙,410082;湖南大学信息科学与工程学院,湖南 长沙,410082;湖南大学信息科学与工程学院,湖南 长沙,410082
基金项目:国家自然科学基金(61872135,61300037);湖南省自然科学基金(2018JJ2066)
摘    要:磨损均衡机制作为闪存转换层的基础机制之一,其主要功能是延长闪存块使用寿命和提高存储数据的可靠性。现有的磨损均衡机制着重于减少闪存块的擦除次数,忽略了在磨损均衡操作过程中选择擦除脏块的不合理所带来的不必要数据迁移开销,从而影响了固态硬盘的整体读写性能。针对该问题,提出了一种基于权重堆排序的 NAND Flash静态磨损均衡机制WHWL。首先,提出一种基于页数据访问频率和块擦除次数的权重的热度计算方法,有效地提高擦除次数少(冷块)且数据访问频率低(冷数据)的目标块命中率,避免了多余的数据迁移操作;其次,提出了一种基于权重的堆排序目标块选择算法,以加快目标块的筛选。实验结果表明,与现有的PWL和BET算法相比,在使用相同映射机制的条件下,WHWL能够分别提升固态硬盘寿命1.28、5.83倍,数据迁移次数也有明显的降低。

关 键 词:权重  堆排序  NAND  Flash  磨损均衡
收稿时间:2018-08-20
修稿时间:2019-02-25

A NAND Flash static wear leveling mechanism based on weighted heap sort
LIU Yan,XU Ji long,ZHU Lei.A NAND Flash static wear leveling mechanism based on weighted heap sort[J].Computer Engineering & Science,2019,41(2):207-213.
Authors:LIU Yan  XU Ji long  ZHU Lei
Affiliation:(College of Computer Science and Electronic Engineering,Hunan University,Changsha 410082,China)
Abstract:As one of the basic mechanisms of the flash translation layer, the wear leveling mechanism is a software algorithm that is applied to extend the life of the flash disk and improve the reliability of stored data. However, existing wear leveling mechanisms are too aggressive to balance the erasure counts of the entire flash memory and ignore the unnecessary data migration overhead due to the unreasonable selection of victim blocks during wear leveling operations, thereby affecting the overall read and write performance of the solid state disk. To solve this problem, we firstly propose a NAND Flash static wear leveling mechanism based on weighted heap sort, namely WHWL. We introduce a weight calculation method based on page data access frequency and the weight of erase counts of the block, which can effectively improve the hit rate of the target blocks with a small number of erases (cold blocks) and a low frequency of data access (cold data), and avoid redundant data migration operations. Secondly, we also propose a victim block selection algorithm based on weighted heap sort to speed up the selection of victim blocks. Experimental results show that compared with the existing PWL and BET algorithms, using the same mapping mechanism, the WHWL can increase the life span of solid state disks by 1.28 and 5.83 times, and also greatly decrease the number of migrations.
Keywords:weight  heap sort  NAND Flash  wear leveling  
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机工程与科学》浏览原始摘要信息
点击此处可从《计算机工程与科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号