• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhang Yao, Chu Jiajia, Weng Chuliang. Survey on Data Updating in Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2020, 57(11): 2419-2431. DOI: 10.7544/issn1000-1239.2020.20190675
Citation: Zhang Yao, Chu Jiajia, Weng Chuliang. Survey on Data Updating in Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2020, 57(11): 2419-2431. DOI: 10.7544/issn1000-1239.2020.20190675

Survey on Data Updating in Erasure-Coded Storage Systems

Funds: This work was supported by the National Natural Science Foundation of China (61772204, 61732014).
More Information
  • Published Date: October 31, 2020
  • In a distributed storage system, node failure has become a normal state. In order to ensure high availability of data, the system usually adopts data redundancy. At present, there are mainly two kinds of redundancy mechanisms. One is multiple replications, and the other is erasure coding. With the increasing amount of data, the benefits of the multi-copy mechanism are getting lower and lower, and people are turning their attention to erasure codes with higher storage efficiency. However, the complicated rules of the erasure coding itself cause the overhead of the read, write, and update operations of the distributed storage systems using the erasure coding to be larger than that of the multiple copies. Therefore, erasure coding is usually used for cold data or warm data storage. Hot data, which requires frequent access and update, is still stored in multiple copies. This paper focuses on the data update in erasure-coded storage systems, summarizes the current optimization work related to erasure coding update from the aspects of hard disk I/O, network transmission and system optimization, makes a comparative analysis on the update performance of representative coding schemes at present, and finally looks forward to the future research trends. Through analysis, it is concluded that the current erasure coding update schemes still cannot obtain the update performance similar to that of multiple copies. How to optimize the erasure-coded storage system in the context of erasure coding update rules and system architecture, so that it can replace the multi-copy mechanism under the hot data scenario, and reducing the hot data storage overhead is still a problem worthy of further study in the future.
  • Related Articles

    [1]A Weighted Directed Graph-based Algorithm for Group Routing in Printed Circuit Boards[J]. Journal of Computer Research and Development. DOI: 10.7544/issn1000-1239.202440069
    [2]Wang Houzhen, Qin Wanying, Liu Qin, Yu Chunwu, Shen Zhidong. Identity Based Group Key Distribution Scheme[J]. Journal of Computer Research and Development, 2023, 60(10): 2203-2217. DOI: 10.7544/issn1000-1239.202330457
    [3]Zhang Qikun, Gan Yong, Wang Ruifang, Zheng Jiamin, Tan Yu’an. Inter-Cluster Asymmetric Group Key Agreement[J]. Journal of Computer Research and Development, 2018, 55(12): 2651-2663. DOI: 10.7544/issn1000-1239.2018.20170651
    [4]Wang Haiyan, Xiao Yikang. Dynamic Group Discovery Based on Density Peaks Clustering[J]. Journal of Computer Research and Development, 2018, 55(2): 391-399. DOI: 10.7544/issn1000-1239.2018.20160928
    [5]Wang Haiyan, Dong Maowei. Latent Group Recommendation Based on Dynamic Probabilistic Matrix Factorization Model Integrated with CNN[J]. Journal of Computer Research and Development, 2017, 54(8): 1853-1863. DOI: 10.7544/issn1000-1239.2017.20170344
    [6]Li Xuefeng, Zhang Junwei, Ma Jianfeng, Liu Hai. TSNP: A Novel PCLSecure and Efficient Group Authentication Protocol in Space Information Network[J]. Journal of Computer Research and Development, 2016, 53(10): 2376-2392. DOI: 10.7544/issn1000-1239.2016.20160453
    [7]Meng Fei, Lan Julong, Hu Yuxiang. A Cooperative Game Based Data Center Backbone Network Bandwidth Allocation Policy[J]. Journal of Computer Research and Development, 2016, 53(6): 1306-1313. DOI: 10.7544/issn1000-1239.2016.20148400
    [8]Zhang Qikun, Wang Ruifang, Tan Yu'an. Identity-Based Authenticated Asymmetric Group Key Agreement[J]. Journal of Computer Research and Development, 2014, 51(8): 1727-1738. DOI: 10.7544/issn1000-1239.2014.20121165
    [9]Wang Feng, Zhou Yousheng, Gu Lize, Yang Yixian. A Multi-Policies Threshold Signature Scheme with Group Verifiability[J]. Journal of Computer Research and Development, 2012, 49(3): 499-505.
    [10]Li Shaofang, Hu Shanli, Shi Chunyi. An Anytime Coalition Structure Generation Based on the Grouping Idea of Cardinality Structure[J]. Journal of Computer Research and Development, 2011, 48(11): 2047-2054.
  • Cited by

    Periodical cited type(3)

    1. 孙颖,丁卫平,黄嘉爽,鞠恒荣,李铭,耿宇. RCAR-UNet:基于粗糙通道注意力机制的视网膜血管分割网络. 计算机研究与发展. 2023(04): 947-961 . 本站查看
    2. 张创邦,王青海. 直觉模糊知识粒的分解与合成研究. 计算机与数字工程. 2022(02): 270-275+299 .
    3. 朱国成. 基于概率语言术语集中考虑专家权重的决策方法研究. 曲阜师范大学学报(自然科学版). 2021(04): 72-80 .

    Other cited types(3)

Catalog

    Article views (970) PDF downloads (487) Cited by(6)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return