Block recycling schemes and their cost-based optimization in nand flash memory based storage system

  • Authors:

  • Jongmin Lee;Sunghoon Kim;Hunki Kwon;Choulseung Hyun;Seongjun Ahn;Jongmoo Choi;Donghee Lee;Sam H. Noh

  • Affiliations:

  • University of Seoul, Seoul, South Korea;Korea University, Seoul, South Korea;University of Seoul, Seoul, South Korea;University of Seoul, Seoul, South Korea;Samsung Electronics Co., Seoul, South Korea;Dankook University, Seoul, South Korea;University of Seoul, Seoul, South Korea;Hongik University, Seoul, South Korea

  • Venue:
  • EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Flash memory has many merits such as light weight, shock resistance, and low power consumption, but also has limitations like the erase-before-write property. To overcome such limitations and to use it efficiently as storage media in mobile systems, Flash memory based storage systems require special address mapping software called the FTL (Flash-memory Translation Layer). Like cleaning in Log-structured file system (LFS), the FTL often performs a merge operation for block recycling and its efficiency affects the performance of the storage system. To reduce the block recycling costs in NAND Flash memory based storage, we introduce another block recycling scheme that we call migration. Our cost-models and experimental results show that cost-based selection of merge or migration for each block recycling can decrease block recycling costs and, therefore, improve performance of Flash memory based storage systems. Also, we derive the macroscopic optimal migration/merge sequence minimizing block recycling costs for each migration/merge combination period. Experimental results show that the performance of Flash memory based storage can be further improved by the macroscopic optimization than the simple cost-based selection.