闪存连续存储单元等概率存储算法设计 0.doc

沈阳建筑大学 毕业设计说明书 毕 业 设 计 题 目 闪存连续存储单元等概率存储算法设计 学院专业班级 信息学院通信工程07-2班 学 生 姓 名 王佳林 性别 男 指 导 教 师 白乐强 职称 教授 201 PAGE 沈阳建筑大学毕业设计（论文） PAGE I 摘 要 本文设计了一种新的闪存文件管理存储算法，能够整体提高闪存的使用寿命和管理效率，通常，一个闪存是由若干个闪存块组成，每个闪存块又分为若干个物理页。闪存块是擦除操作的最小单位，而读和写都是以页为单位进行，对一个物理页进行重写之前，必须先对该页所在的块执行擦除操作。而每一个闪存块的擦除次数是有限的，一般是在10万次至100万次之间，只要有一个闪存块的擦除次数达到了上限，数据存储就变得不可靠，会影响到整个闪存的读写效率和性能。因此，需要设计高效的磨损均衡处理策略，该算法是在磨损均衡处理策略的基础上，增加了连续性的算法，使文件相对连续，方便管理，并且使每部分的空间利用率达到均衡。在相同操作的情况下，传统的文件管理系统只有前半部分甚至更少的空间被多次使用，而在本文设计的闪存文件管理系统中不仅能够使每个闪存块使用次数相对均衡而且文件管理方便。本文设计的管理系统相较于传统系统有更好的性能，尤其在操作次数较多的情况下，这种系统的优势凸显。 关键词：闪存；磨损均衡；排序；连续；文件系统 Abstract This paper presents a new algorithm for the flash memory file management, to improve the overall management efficiency and service life of flash memory. Usually, a flash memory is made by the number of blocks. Each memory block is divided into a number of physical pages. Flash block is the smallest unit of erase operation, and is based on pages reading and writing unit. To rewrite a physical page, you must perform on the page where the block erases operation. And each erase block number of flash memory is limited, generally from 10 million to 100 million times. If there is a flash erase block reached the maximum number of data storage it will become unreliable, and will affect reading and writing of the whole flash memory efficiency and performance. Therefore, it needs to design an efficient strategy for the wearing balance. The equalization algorithm is the wear on the basis of strategies to increase the continuity of the algorithm, so the file is relatively continuous, easy managing, and space utilization of every part of the equilibrium. In the same operating conditions, the traditional document management system or less only the former half of the space be used multiple times, and in this paper flash file management system designed to enable not only the frequency of use of each flash memory block for file