基于逻辑区间热度的NAND闪存垃圾回收算法

针对现有的NAND闪存垃圾回收算法中回收性能不高,磨损均衡效果差,并且算法内存开销大的问题,提出了一种基于逻辑区间热度的垃圾回收算法。该算法重新定义了热度计算公式,把连续逻辑地址的NAND内存定义为一个热度区间,以逻辑区间的热度来代替逻辑页的热度,并将不同热度的数据分开存储到不同擦除次数的闪存块上,有效地实现了数据冷热分离,并且节约了内存空间。同时,算法还构造了一种新的回收代价函数来选择回收块,在考虑回收效率的同时,还兼顾了磨损均衡的问题。实验结果表明,该算法与性能优异的FaGC算法相比,总的擦除次数减少了11%,总的拷贝次数减少了13%,擦次数最大差值减少了42%,内存消耗能减少了75%。因此,该算法有利于增加闪存可用空间,改善闪存系统的读写性能,延长闪存使用寿命。     

基于逻辑页冷热分离的NAND闪存磨损均衡算法

针对现有的NAND闪存垃圾回收算法对磨损均衡考虑不足的问题,提出了一种基于逻辑页冷热分离的NAND闪存磨损均衡算法。算法同时考虑了无效页的年龄、物理块的擦除次数以及物理块更新的频率,采用混合模式选择回收符合条件的物理块。同时,推导了一种新的逻辑页热度计算方法,并将回收块上有效页数据按照逻辑页的热度进行了冷热分离。实验结果表明,与GR算法、CB算法、CAT算法以及FaGC算法相比,该算法不仅在磨损均衡上取得了很好的效果,而且总的擦除次数与拷贝次数也有了明显减少。     

一种基于逻辑页平均更新频率的NAND闪存垃圾回收算法

针对NAND闪存的特点,提出一种基于逻辑页平均更新频率的NAND闪存垃圾回收算法。该算法采用无效页年龄和作为回收块选择策略。同时,在FaGC和GCbAH算法基础之上,重新定义数据热度计算公式,采用逻辑页平均更新频率取代固定阈值作为冷热数据的判定依据,实现了更准确的冷热数据判定和分离。实验结果表明,相较于GR、CB、CAT、FaGC和GCbAH算法,该算法在垃圾回收代价和磨损均衡方面均取得了更好的效果。     

基于权重堆排序的NAND Flash静态磨损均衡机制

磨损均衡机制作为闪存转换层的基础机制之一,其主要功能是延长闪存块使用寿命和提高存储数据的可靠性。现有的磨损均衡机制着重于减少闪存块的擦除次数,忽略了在磨损均衡操作过程中选择擦除脏块的不合理所带来的不必要数据迁移开销,从而影响了固态硬盘的整体读写性能。针对该问题,提出了一种基于权重堆排序的 NAND Flash静态磨损均衡机制WHWL。首先,提出一种基于页数据访问频率和块擦除次数的权重的热度计算方法,有效地提高擦除次数少（冷块）且数据访问频率低（冷数据）的目标块命中率,避免了多余的数据迁移操作;其次,提出了一种基于权重的堆排序目标块选择算法,以加快目标块的筛选。实验结果表明,与现有的PWL和BET算法相比,在使用相同映射机制的条件下,WHWL能够分别提升固态硬盘寿命1.28、5.83倍,数据迁移次数也有明显的降低。     

磨损均衡算法在NAND Flash管理中的改进

由于Flash具有擦除次数有限、先擦后写的特点,会带来使用寿命有限的缺陷。为延长其预期使用寿命,普遍采用磨损均衡算法对各存储单元进行管理。该算法核心在每次写操作时将新数据写入到最少被使用的物理块中。本文对该算法在垃圾回收策略和对静态文件管理方式做出改进。垃圾回收时在遵照磨损均衡原则的前提下提高写入数据效率,同时增强该算法对不同类型的文件存储单元管理能力,从而达到更加有效的磨损均衡。     

基于大容量闪存的嵌入式文件系统

采用以页为单位的文件节点存储形式和综合考虑数据时间局部性与均衡磨损要求的收益成本垃圾回收算法,设计了一种新的文件系统。分析和实验表明,相对于JFFS2,该文件系统在降低内存消耗和闪存磨损倾斜度的同时,提高了垃圾回收效率和系统性能。     

Android存储系统中NAND闪存性能的改进

针对Android存储系统在闪存管理上存在较差的磨损均衡效果和较高的垃圾回收额外开销的缺陷,引入冷热数据分离策略,将文件按照不同热度写入对应热度的物理存储单元,同时改进垃圾回收策略,以达到良好的磨损均衡效果并减少垃圾回收额外开销。基于Android平台的实验结果表明,改进后的策略在有效减少NAND闪存垃圾回收额外开销的同时,还能有效改善其磨损均衡效果。     

一种有效的混合式闪存磨损均衡算法

为延长嵌入式系统中作为外部存储设备的闪存介质的使用寿命,普遍采用磨损均衡算法时各物理块进行管理.本文对现有的确定性磨损均衡算法进行改进,结合随机性处理,提出HWL(Hybrid Wear Leveling)算法,不仅使磨损均衡处理只占用很少的内存开销,还能有效地进行"冷热"数据存放位置的交换.在多种逻辑页更新模式的仿真试验中,物理块彼此之间都能达到较为接近的擦除次数;与已有算法相比,磨损均衡处理引起的额外擦除较少,可延长闪存的使用寿命.     

OEBS:一种闪存磨损均衡算法

闪存诞生以来得到了广泛应用,它的特性包括:块擦除次数有限和擦除后重写.这两个特性都会影响闪存的使用寿命.针对这一问题,本文提出并实现了一种新颖的磨损均衡算法-OEBS(Outstanding Erase Block Set) -显性擦除块集.该方法通过高低频数据互换,有效均衡了擦除分布;使用显性擦除块集保护显性擦除块,避免了互换颠簸;将显性擦除块集和非显性擦除块集分开管理,提高了效率.模拟实验数据结合量化了的使用寿命延长度,表明数据块的擦除分布均匀,效率较高,有效延长了闪存的使用寿命.     

考虑操作时间局部性的NAND闪存脏块回收算法

在闪存存储系统的脏块回收过程中,按照对数据操作的时间,将脏块中的有效数据分拣成"热"数据和"冷"数据,分别写入到当前"热"写入块和"冷"写入块中,减少在回收过程中多次对"冷"数据的无意义重复拷贝;同时在挑选脏块进行回收时,利用脏块中的有效数据量、块的最近更新时间、以及块的磨损程度构造代价函数,选整体效果最优的脏块进行回收操作.实验表明,与当前各种主要脏块回收算法相比,有较好的回收操作效率,降低了总体的块磨损程度,并有较好的块磨损均衡度.     

Garbage collection of multi-version indexed data on flash memory

Maintaining a multi-version index on flash memory could generate a lot of updates and invalid pages. It is important to have an efficient garbage collection mechanism to ensure the flash memory has sufficient number of free blocks for storing new data versions and their index structures. In this paper, we study the important performance issues in using the purging-range query to reclaim the blocks, which are storing old data versions and invalid index entries, to be free blocks. To reduce the cost for processing the purging-range query, we propose the physical block labeling (PBL) scheme to provide a better estimation on the purging version number to be used for purging old data versions. To further enhance the performance of the garbage collection process, and at the same time to maximize the deadspans of data versions and balance the wear levels of the blocks, we propose two schemes called, the sequential placement (SQ) and frequency-based placement (FBP), for placing new data versions into free pages. As illustrated in the performance studies, both SQ and FBP can effectively balance the wear levels of the blocks. The deadspans of data versions are longer under FBP than both SQ and RR, and the page reallocation cost is also lower under FBP especially when the size of flash memory allocated for the database is limited. The experimental results also illustrate that PBL can effectively minimize the number of invocations of the purging-range query to be one to reclaim the required number of blocks in each garbage collection.     

利用页面重构与数据温度识别的闪存缓存算法

基于闪存的固态盘(SSD)具有比磁盘更加优越的性能,并且在桌面系统中逐渐替代磁盘.但是,尽管在SSD中嵌入了DRAM作为缓存,闪存在不断写入的过程中也可能产生不稳定的写性能,主要是因为逻辑页写入时会频繁引发非覆盖写和垃圾回收操作.针对此问题,提出了一种叫作PRLRU的新型闪存缓存管理方法,通过页面重构机制以及数据温度识...     

3G智能卡文件系统的研究与设计

对基于Flash的3G智能卡文件系统的研究与设计,引用了数据库日志技术和掉电保护机制,保证了智能卡文件系统可靠性,数据的一致性和完整性;按字节静态分配存储空间、合理有效地回收与重用碎片空间,提高了存储空间的利用率;平均磨损和页面映射技术的使用延长了Flash的使用寿命;有效的存储设计提高了数据检索的速度,从而提高了智能卡的整体性能。测试证实了该文件系统设计适合3G EVDO卡。     

FeGC: An efficient garbage collection scheme for flash memory based storage systems

NAND flash memory is a promising storage media that provides low-power consumption, high density, high performance, and shock resistance. Due to these versatile features, NAND flash memory is anticipated to be used as storage in enterprise-scale systems as well as small embedded devices. However, unlike traditional hard disks, flash memory should perform garbage collection that consists of a series of erase operations. The erase operation is time-consuming and it usually degrades the performance of storage systems seriously. Moreover, the number of erase operations allowed to each flash memory block is limited. This paper presents a new garbage collection scheme for flash memory based storage systems that focuses on reducing garbage collection overhead, and improving the endurance of flash memory. The scheme also reduces the energy consumption of storage systems significantly. Trace-driven simulations show that the proposed scheme performs better than various existing garbage collection schemes in terms of the garbage collection time, the number of erase operations, the energy consumption, and the endurance of flash memory.     

大容量闪存的层次型热数据识别框架

热数据识别对于提高闪存垃圾回收的效率、延长闪存寿命都有重要的作用。针对大数据量下热数据识别难的情况,该文提出一种层次型热数据识别框架,采用在多个层次上记录热数据的方法。实验证明,该框架能够在消耗较少资源的情况下,识别和预测出大数据量中的热数据。     

DeFFS: Duplication-eliminated flash file system

Whenever files are modified, large parts of existing data must get unnecessarily re-written to storage due to the inefficiency on identifying those portions of the files that are actually new in the latest update. The unmodified data are considered as duplicate data since these do not have to be re-written. If NAND flash memory is used for storage, it is beneficial to reduce the duplicate data as many as possible. The issue is how to identify and eliminate the duplicate region efficiently. In this paper, the advanced architecture of flash file system, called duplication-eliminated flash file system, is introduced for duplicate elimination. The important design issues supporting duplicate elimination are how to manage data blocks and how to detect duplicate region. In the DeFFS, index entries of inodes support variable-sized blocks in order to increase the manageability and flexibility of duplicate regions. In addition, DeFFS uses non-overlapping duplicate checking algorithm to reduce the complexity of duplicate checking algorithm. The duplicate elimination can prolong flash memory life cycles by reducing actual amount of page writes, and increase write bandwidth.