Stripe Matching and Merging Algorithm-based Redundancy Transition for Locally Repairable Codes

Compared with traditional replication technique, erasure coding is another data redundancy mechanism with lower space overhead at the cost of high repair cost.Locally repairable code is a special kind of erasure code with low repair cost, which is widely deployed in big data storage systems.In order...

Full description

Saved in:
Bibliographic Details
Published inJi suan ji ke xue Vol. 50; no. 12; p. 89
Main Authors Du, Qingpeng, Xu, Yinlong, Wu, Si
Format Journal Article
LanguageChinese
Published Chongqing Guojia Kexue Jishu Bu 01.01.2023
Subjects
Algorithms
Big Data
Communications traffic
Data storage
Failure rates
Layouts
Optimization models
Placement
Redundancy
Storage systems
Online AccessGet full text

Cover

More Information
Summary:Compared with traditional replication technique, erasure coding is another data redundancy mechanism with lower space overhead at the cost of high repair cost.Locally repairable code is a special kind of erasure code with low repair cost, which is widely deployed in big data storage systems.In order to accommodate itself to dynamic workload and varying failure rate of sto-rage media, modern storage systems make better trade off between access performance and reliability for erasure coded data by means of redundancy transitions.A redundancy transition method, which selectively matches and merges stripes of specific layout, decouples data placement and redundancy transition, is proposed.Furthermore, it reduces the cross-rack network traffic by designing cost quantification and optimization model.In contrast to those algorithms that designing data placement, the proposed algorithm has almost the same performance but eliminates the constraints on data layout and can be run iteratively.Experiment results show that
ISSN:1002-137X