Data Movement and Aggregation in Flash Memories

被引:0
|
作者
Jiang, Anxiao [1 ]
Langberg, Michael [2 ]
Mateescu, Robert [3 ]
Bruck, Jehoshua [4 ]
机构
[1] Texas A&M Univ, CSE Dept, College Stn, TX 77843 USA
[2] Open Univ Israel, Comp Sci Div, IL-43107 Raanana, Israel
[3] Microsoft Res Cambridge, Cambridge CB3 0FB, England
[4] CALTECH, EE & CNS Dept, Pasadena, CA 91125 USA
来源
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY | 2010年
关键词
D O I
10.1109/ISIT.2010.5513391
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
NAND flash memories have become the most widely used type of non-volatile memories. In a NAND flash memory, every block of memory cells consists of numerous pages, and rewriting a single page requires the whole block to be erased. As block erasures significantly reduce the longevity, speed and power efficiency of flash memories, it is critical to minimize the number of erasures when data are reorganized. This leads to the data movement problem, where data need to be switched in blocks, and the objective is to minimize the number of block erasures. It has been shown that optimal solutions can be obtained by coding. However, coding-based algorithms with the minimum coding complexity still remain an important topic to study. In this paper, we present a very efficient data movement algorithm with coding over GF(2) and with the minimum storage requirement. We also study data movement with more auxiliary blocks and present its corresponding solution. Furthermore, we extend the study to the data aggregation problem, where data can not only be moved but also aggregated. We present both non-coding and coding-based solutions, and rigorously prove the performance gain by using coding.
引用
收藏
页码:1918 / 1922
页数:5
相关论文
共 50 条
  • [1] Data Movement in Flash Memories
    Jiang, Anxiao
    Langberg, Michael
    Mateescu, Robert
    Bruck, Jehoshua
    2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 1031 - +
  • [2] Algorithms and data structures for flash memories
    Gal, E
    Toledo, S
    ACM COMPUTING SURVEYS, 2005, 37 (02) : 138 - 163
  • [3] Study of data retention for nanocrystal Flash memories
    Compagnoni, CM
    Ielmini, D
    Spinelli, AS
    Lacaita, AL
    Previtali, C
    Gerardi, C
    41ST ANNUAL PROCEEDINGS: INTERNATIONAL RELIABILITY PHYSICS SYMPOSIUM, 2003, : 506 - 512
  • [4] FRCD: Fast recovery of compressible data in flash memories
    Nazari, Mahyar
    Zadeh, Reza Taghi
    Asghari, Seyyed Amir
    Marvasti, Mohammadreza Binesh
    Rahmani, Amir M.
    COMPUTERS & ELECTRICAL ENGINEERING, 2019, 78 : 520 - 535
  • [5] Data deletion method for security improvement of Flash memories
    Xin, Ruishan
    Ye, Mao
    Wang, Jia
    Hui, Kai
    Zhao, Yiqiang
    IEICE ELECTRONICS EXPRESS, 2018, 15 (08):
  • [6] Annealing of Static Data Errors in NAND-Flash Memories
    Schmidt, H.
    Walter, D.
    Brueggemann, M.
    Gliem, F.
    Harboe-Sorensen, R.
    Roos, P.
    RADECS 2007: PROCEEDINGS OF THE 9TH EUROPEAN CONFERENCE ON RADIATION AND ITS EFFECTS ON COMPONENTS AND SYSTEMS, 2007, : 224 - +
  • [7] FLASH MEMORIES ON THE RISE
    HARRIS, P
    MICROELECTRONICS JOURNAL, 1994, 25 (05) : R5 - R8
  • [8] On The Capacity of Flash Memories
    Jiang, Anxiao
    Bruck, Jehoshua
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 93 - +
  • [9] Spatial Generalization and Aggregation of Massive Movement Data
    Andrienko, Natalia
    Andrienko, Gennady
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (02) : 205 - 219
  • [10] When good memories go bad: Data recovery of flash media
    Barry, Sean
    Ontrack, Kroll
    ECN Electronic Component News, 2009, 53 (08):