一种基于功能表的高效FTL算法  

An Efficient FTL Algorithm Based on Function Tables

作　　者：吴俊军[1] 刘震宇[1] 

机构地区：[1]华中科技大学计算机科学与技术学院软件与嵌入式系统工程研究中心,湖北武汉430074

出　　处：《计算机工程与科学》2010年第11期128-131,135,共5页Computer Engineering & Science

摘　　要：FTL用于将闪存模拟成标准的块设备以屏蔽其写前进行擦除的特性。传统的FTL算法采用扫描冗余区的方式建立映射表,初始化速度慢,并通过单纯的映射表实现地址转换,只能部分改善空间利用率,有的甚至提高了块回收代价,使运行效率变得低效。本文提出了功能表的思想,通过状态表寻址直接建立块映射表和块信息来提高启动速度,降低空间复杂度。通过将映射表与块信息相结合来实现读写操作中地址的查找,均衡了空间利用率和回收代价。FTL is used to emulate a flash memory as a standard block device via hiding the erase-before-write characteristics of the NAND flash. As conventional FTLs slow the initialization by scanning the spare area of blocks to build mapping tables, and implement address translation with a single mapping table, they can only improve space utilization partially, some of which even increase the hlock recycling cost and debase the operating efficiency. In this paper, an idea of funtion table is proposed to build the block mapping table and block information by the status table, which accelerates the mounting speed, and decreases the space complexity as well. Meanwhile, the mapping table is combined with the block information to achieve fast addressing in reading and writing, and also balances the space utilization and the recycling cost.

关 键 词：NAND型闪存 闪存转换层 均衡磨损 地址映射 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]