Computer Science ›› 2023, Vol. 50 ›› Issue (7): 38-45.doi: 10.11896/jsjkx.220900179

• Database & Big Data & Data Science • Previous Articles     Next Articles

Policy Optimization Scheme of Refresh and Duplication Combination Based on LDPC Read Delay

ZHANG Yaofang1,2,3,4, LI Peixuan1,2,3,4, XIE Ping1,2,3,4,5   

  1. 1 The College of Computer,Qinghai Normal University,Xining 810016,China
    2 The State Key Laboratory of Tibetan Intelligent Information Processing and Application,Xining 810008,China
    3 The Key Laboratory of Internet of Things of Qinghai Province,Xining 810016,China
    4 Academy of Plateau Science and Sustainability,Xining 810016,China
    5 Network Information Management Center of Qinghai Normal University,Xining 810006,China
  • Received:2022-09-19 Revised:2023-02-27 Online:2023-07-15 Published:2023-07-05
  • About author:ZHANG Yaofang,born in 1995,postgraduate candidate,is a member of China Computer Federation.Her main research interest is network storage.XIE Ping,born in 1979,Ph.D,professor,is a member of China Computer Federation.His main research interests include computer architecture,and mass storage system.
  • Supported by:
    National Natural Science Foundation of China(61762075) and Key Laboratory of IoT of Qinghai(2022-ZJ-Y21).

Abstract: Aiming at the problem of reliability degradation caused by the increase of the density and capacity of flash memory,an optimization scheme of refresh and copy combination strategy based on LDPC read delay is proposed.In general,the original strategy is to add LDPC code module to flash memory and use hard and soft decoding to correct data errors.The traditional refresh strategy is based on the original strategy,when the LDPC soft decoding fails to correct the error,the refresh strategy is used to correct the error.The scheme is based on the characteristics of LDPC soft decoding 7 quantitative levels,and takes this as the judgment condition,using the method of analysis and comparison to determine that the condition of refresh is level 3,the condition of the copy is level 5,and the two methods are reasonably applied in the LDPC soft decoding mode.Compared with the previous two strategies,the average response time of flash memory is reduced,and the read performance of flash memory is improved to a certain extent.Simulation is performed on the extended platform of the simulator disksim+ssd,and experimental results show that,the average response time of this scheme is 10% shorter than that of the original strategy,and its flash memory lifetime is prolonged compared to traditional refresh strategies.

Key words: Flash memory, Low-density parity-check codes, Refresh, Duplication, Response time, Lifetime

CLC Number: 

  • TP393
[1]CERNEA R A,PHAM L,MOOGAT F,et al.A 34 MB/s MLC write throughput 16 Gb NAND with all bit line architecture on 56 nm technology[J].IEEE Journal of Solid-State Circuits,2008,44(1):186-194.
[2]TOKUTOMI T,TANAKAMARU S,IWASAKI T O,et al.Ad-vanced error prediction LDPC for high-speed reliable TLC nand-based SSDs[C]//2014 IEEE 6th International Memory Workshop(IMW).IEEE,2014:1-4.
[3]SUKKWANG P,JAEKYUN M.Characterization of Inter-CellInterference in 3D {NAND} Flash Memory[J].IEEE Trans.Circuits Syst.{I} Regul.Pap,2021,68(3):1183-1192.
[4]RIZVI S S,CHUNG T S.Flash SSD vs HDD:High performance oriented modern embedded and multimedia storage systems[C]//2010 2nd International Conference on Computer Engineering and Technology.IEEE,2010:297-299.
[5]LEE S,LEE J,PARK I,et al.7.5 A 128Gb 2b/cell NAND flash memory in 14nm technology with tPROG=640μs and 800MB/s I/O rate[C]//2016 IEEE International Solid-State Circuits Conference(ISSCC).IEEE,2016:138-139.
[6]JEONG W,IM J,KIM D H,et al.A 128 Gb 3b/cell V-NAND flash memory with 1 Gb/s I/O rate[J].IEEE Journal of Solid-State Circuits,2015,51(1):204-212.
[7]LI S,ZHANG T.Improving Multi-Level NAND Flash Memory Storage Reliability Using Concatenated BCH-TCM Coding[J].IEEE Transactions on Very Large Scale Integration Systems,2010,18(10):1412-1420.
[8]REN J,DING X,XIN X N,et al.An NB-LDPC decoder Algorithm combined using channel information for Storage Application[C]//2020 IEEE 5th International Conference on Integrated Circuits and Microsystems(ICICM).IEEE,2020:306-309.
[9]KANG D,JEONG W,KIM C,et al.256 Gb 3 b/cell V-NAND flash memory with 48 stacked WL layers[J].IEEE Journal of Solid-State Circuits,2016,52(1):210-217.
[10]LI Q,SHI L,XUE C J,et al.Improving LDPC performance via asymmetric sensing level placement on flash memory[C]//2017 22nd Asia and South Pacific Design Automation Conference(ASP-DAC).IEEE,2017:560-565.
[11]GALLAGER R.Low-density parity-check codes[J].IRE Tran-sactions on Information Theory,1962,8(1):21-28.
[12]SHOKROLLAHI A.An Introduction to Low-Density Parity-Check Codes[C]//TACSCI 2000.Berlin:Springer.2002:175-197.
[13]CAI Y,YALCIN G,MUTLU O,et al.Flash correct-and-re-fresh:Retention-aware error management for increased flash memory lifetime[C]//2012 IEEE 30th International Conference on Computer Design(ICCD).IEEE,2012:94-101.
[14]PAN Y,DONG G,WU Q,et al.Quasi-nonvolatile SSD:Trading flash memory nonvolatility to improve storage system perfor-mance for enterprise applications[C]//IEEE International Symposium on High-Performance Comp Architecture.IEEE,2012:1-10.
[15]DU Y,LI Q,SHI L,et al.Reducing LDPC soft sensing latency by lightweight data refresh for flash read performance improvement[C]//2017 54th ACM/EDAC/IEEE Design Automation Conference(DAC).IEEE,2017:1-6.
[16]LV Y,SHI L,LI Q,et al.Optimizing Tail Latency of LDPCbased Flash Memory Storage Systems Via Smart Refresh[C]//2019 IEEE International Conference on Networking,Architecture and Storage(NAS).IEEE,2019:1-8.
[17]DI Y,SHI L,GAO C,et al.Minimizing retention induced refresh through exploiting process variation of flash memory[J].IEEE Transactions on Computers,2018,68(1):83-98.
[18]CAI Y,LUO Y,GHOSE S,et al.Read disturb errors in MLC NAND flash memory:Characterization,mitigation,and recovery[C]//2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks.IEEE,2015:438-449.
[19]LI P,ZHANG Y,YIN D,et al.An Efficient Refresh Strategy of Flash Memory via High Delay Blocks in LDPC[C]//2021 6th International Conference on Integrated Circuits and Microsystems(ICICM).IEEE,2021:299-304.
[20]LI P,ZHANG Y,YIN D,et al.A High Precision Refresh Me-thod to Improve The Performance of Flash Storage Devices[C]//2021 20th International Symposium on Distributed Computing and Applications for Business Engineering and Science(DCABES).IEEE,2021:214-217.
[21]GHEMAWAT S,GOBIOFF H,LEUNG S T.The Google file system[C]//Proceedings of the nineteenth ACM Symposium on Operating Systems Principles.2003:29-43.
[22]DECANDIA G,HASTORUN D,JAMPANI M,et al.Dynamo:Amazon’s highly available key-value store[J].ACM SIGOPS Operating Systems Review,2007,41(6):205-220.
[23]KISTLER J J,SATYANARAYANAN M.Disconnected operation in the Coda file system[J].ACM Transactions on Computer Systems(TOCS),1992,10(1):3-25.
[24]WEIL S A,BRANDT S A,MILLER E L,et al.Ceph:A scalable,high-performance distributed file system[C]//Proceedings of the 7th Symposium on Operating Systems Design and Implementation.2006:307-320.
[25]BONVIN N,PAPAIOANNOU T G,ABERER K.Dynamic cost-efficient replication in data clouds[C]//Proceedings of the 1st Workshop on Automated Control for Datacenters and Clouds.2009:49-56.
[26]MUTHITACHAROEN A,CHEN B,MAZIERES D.A low-bandwidth network file system[C]//Proceedings of the eighteenth ACM Symposium on Operating Systems Principles.2001:174-187.
[27]SAITO Y,KARAMANOLIS C,KARLSSON M,et al.Taming aggressive replication in the Pangaea wide-area file system[C]//Proceedings of the 5th Symposium on Operating Systems Design and Implementation.USENIX Association,2002:15 -30.
[28]CALDER B,WANG J,OGUS A,et al.Windows azure storage:a highly available cloud storage service with strong consistency[C]//Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles.2011:143-157.
[29]BINDEL D,CHEN Y,EATON P,et al.Oceanstore:An ex-tremely wide-area storage system[C]//Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems.2000:190-201.
[1] YANG Qianlong, JIANG Lingyun. Study on Load Balancing Algorithm of Microservices Based on Machine Learning [J]. Computer Science, 2023, 50(5): 313-321.
[2] JIAO Tianzhe, HE Hongyan, ZHANG Zexin, SONG Jie. Study on Big Graph Traversals for Storage Medium Optimization [J]. Computer Science, 2023, 50(1): 34-40.
[3] WANG Fang-hong, FAN Xing-gang, YANG Jing-jing, ZHOU Jie, WANG De-en. Strong Barrier Construction Algorithm Based on Adjustment of Directional Sensing Area [J]. Computer Science, 2022, 49(6A): 612-618.
[4] SHEN Hao-xi, NIU Bao-ning. Gating Mechanism for Real-time Network I/O Requests Based on Para-virtualization Virtio Framework [J]. Computer Science, 2022, 49(2): 368-376.
[5] YAO Ze-wei, LIU Jia-wen, HU Jun-qin, CHEN Xing. PSO-GA Based Approach to Multi-edge Load Balancing [J]. Computer Science, 2021, 48(11A): 456-463.
[6] XU Kun, FU Yin-jin, CHEN Wei-wei, ZHANG Ya-nan. Research Progress on Blockchain-based Cloud Storage Security Mechanism [J]. Computer Science, 2021, 48(11): 102-115.
[7] ZHANG Xuan, LI Xiao-qiang, YAN Sha. Reliability-based Scheduling for Bit-flipping Decoding Algorithm of LDPC Codes [J]. Computer Science, 2019, 46(6A): 329-331.
[8] ZHANG Jian-shan, LIN Bing, LU Yu, XU Fu-rong. Cloudlet Placement and User Task Scheduling Based on Wireless Metropolitan Area Networks [J]. Computer Science, 2019, 46(6): 128-134.
[9] ZHANG Xuan, JIANG Chao, LI Xiao-qiang, YAN Sha. Gradient Descent Bit-flipping Decoding Algorithm Based on Updating of Variable Nodes [J]. Computer Science, 2018, 45(8): 80-83.
[10] FAN Xing-gang, LIU Tao, HU Feng-dan, HAO Xiang. Swarm Intelligence Algorithm for Prolonging Target Coverage Network Lifetime [J]. Computer Science, 2018, 45(12): 86-91.
[11] ZHANG Gui-peng, CHEN Ping-hua. Secure Data Deduplication Scheme Based on Merkle Hash Tree in HybridCloud Storage Environments [J]. Computer Science, 2018, 45(11): 187-192.
[12] TIAN Xian-zhong and LIN Chu-chao. Layer-step Data Collection Scheme for RF Harvesting Wireless Sensor Network [J]. Computer Science, 2017, 44(Z11): 281-285.
[13] ZHU Yue, WU Fei, XIONG Qin and XIE Chang-sheng. Read-Write Performance Optimization Scheduling Scheme for SSD [J]. Computer Science, 2017, 44(6): 51-56.
[14] CHANG Jie and ZHANG Ling. Optimal Path Planning for Mobile Sink in Random Distributed Wireless Sensor Networks [J]. Computer Science, 2017, 44(2): 147-151.
[15] XU Jing-jing, ZHANG Xin-hui, XU Bi-xiao and SUN Zhi-xin. Survey of Clustering Algorithms for Wireless Sensor Networks [J]. Computer Science, 2017, 44(2): 31-37.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!