xStripeMerge:基于纠删码存储的高效宽条带生成方法OACSCD

To address the issue of wide stripe generation in existing erasure coding storage systems,where storage scaling approaches resulted in a significant increase in wide stripe generation bandwidth and stripe merge scheme was con-strained by dual-stripes,an efficient wide stripe generation approach was proposed for the wide stripe generation problem under multi stripes merging.Two key operators for the multi-stripes merging progress were defined,and the wide stripe generation problem was modeled as a combinatorial optimization problem.The efficient wide stripe generation approach xStripeMerge was proposed that prioritize the search for narrow-stripes combining schemes with small parity block transmission costs.Experimental results show that xStripeMerge can reduce the wide stripe generation bandwidth by 75%compared to the advanced storage scaling method.The time and space complexity of xStripeMerge is much better than that of the extended dual-stripes merge approach.xStripeMerge can get the wide stripe generation scheme with similar performance in a shorter period of time and it is also suitable for large-scale storage systems.