胡宁, 杨琼, 王冬. 基于分组的NandFlash块管理方法[J]. 微电子学与计算机, 2015, 32(3): 19-22.
引用本文: 胡宁, 杨琼, 王冬. 基于分组的NandFlash块管理方法[J]. 微电子学与计算机, 2015, 32(3): 19-22.
HU Ning, YANG Qiong, WANG Dong. NandFlash Memory Management Based on Blocks Set[J]. Microelectronics & Computer, 2015, 32(3): 19-22.
Citation: HU Ning, YANG Qiong, WANG Dong. NandFlash Memory Management Based on Blocks Set[J]. Microelectronics & Computer, 2015, 32(3): 19-22.

基于分组的NandFlash块管理方法

NandFlash Memory Management Based on Blocks Set

  • 摘要: 为有效管理NandFlash存储空间,提出了单替换块组相联映射方法.将NandFlash擦除块的集合划分成若干虚拟组,逻辑空间和虚拟空间映射时,组内的页任意映射,组间一一映射.一个虚拟组只设置一个替换块,用于组内无效页的回收和重用.该方法能够保持较高的空间利用率,垃圾回收时间确定.利用存储设备访问的局部性,仅把需要的组映射表装入内存,内存开销小.分析表明,虚拟组大小为16个擦除块时工程实践是合适的.

     

    Abstract: In order to manage the NandFlash memory space effectively, a set associative mapping method with single replacing block is presented. The NandFlash erasable blocks is divided to several virtual block sets. When the logical space is mapped to the virtual space, the logical pages in one block set are mapped to any virtual pages in the same one block set, and the logical sets are mapped to the virtual sets one by one. Only one replacing block is set in one virtual set, which is used to withdraw and reuse the invalid pages. This method can raise the storage space utilization ratio and assure the time consumptions of the garbage withdrawing. Only the required mapping tables have to load into the memory due to the locality of the data accessing, which decreases the memory usage. The analysis results show that 16 blocks is appropriate in one virtual set for engineering practice.

     

/

返回文章
返回