Abstract: Aiming at the problem of large storage system’s management, a direct addressing algorithm is described in embedded file system. Tnode-tree and dynamic-TnodeWidth are used to address most kinds of NAND flash, the method of chunk group is mentioned. The Dynamic wear-leveling algorithm and static wear-leveling algorithm according to the different erasing times of block are presented to realize The garbage- collection and wear-leveling.

Key words: file system, Tnode-tree, dynamic TnodeWidth, threshold

摘要： 针对大容量存储管理问题，论述管理NAND Flash系统中直接寻址的算法实现，提出建立节点树、底层节点动态位宽等概念，实现对不同类型闪存进行灵活可变的直接寻址。通过建立页数组增大文件系统的直接寻址范围，根据区块数据不同的更新频率分别设计动态损耗均衡算法和静态损耗均衡算法，用于实现需求块回收和损耗均衡。

关键词: 文件系统, 节点树, 动态位宽, 阈值

CLC Number: 

• TP333