Data movement in flash memories

  • Authors:

  • Anxiao Jiang;Michael Langberg;Robert Mateescu;Jehoshua Bruck

  • Affiliations:

  • Computer Science Department, Texas A&M University, College Station, TX;Computer Science Division, Open University of Israel, Raanana, Israel;Electrical Engineering Dept., Caltech, Pasadena, CA;EE & CNS Dept., Caltech, Pasadena, CA

  • Venue:
  • Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

NAND flash memories are the most widely used non-volatile memories, and data movement is common in flash storage systems. We study data movement solutions that minimize the number of block erasures, which are very important for the efficiency and longevity of flash memories. To move data among n blocks with the help of Δ auxiliary blocks, where every block contains m pages, we present algorithms that use Θ(n ċ min{m, logΔ n}) erasures without the tool of coding. We prove this is almost the best possible for non-coding solutions by presenting a nearly matching lower bound. Optimal data movement can be achieved using coding, where only Θ(n) erasures are needed. We present a coding-based algorithm, which has very low coding complexity, for optimal data movement. We further show the NP hardness of both coding-based and noncoding schemes when the objective is to optimize data movement on a per instance basis.