xStripeMerge: efficient wide stripe generation approach based on erasure coding storage
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 constrained by dual-stripes, an efficient wide stripe generation approach was...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2023-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023217/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841540079459237888 |
|---|---|
| author | Meiguang ZHENG Taofei HUA Xinyu ZHANG Zhigang HU |
| author_facet | Meiguang ZHENG Taofei HUA Xinyu ZHANG Zhigang HU |
| author_sort | Meiguang ZHENG |
| collection | DOAJ |
| description | 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 constrained 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. |
| format | Article |
| id | doaj-art-e064735c7c93485ba263f3569aa93753 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2023-11-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-e064735c7c93485ba263f3569aa937532025-01-14T06:28:18ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2023-11-014421322459389820xStripeMerge: efficient wide stripe generation approach based on erasure coding storageMeiguang ZHENGTaofei HUAXinyu ZHANGZhigang HUTo 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 constrained 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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023217/distributed storageerasure codingwide stripestripe mergeparity align |
| spellingShingle | Meiguang ZHENG Taofei HUA Xinyu ZHANG Zhigang HU xStripeMerge: efficient wide stripe generation approach based on erasure coding storage Tongxin xuebao distributed storage erasure coding wide stripe stripe merge parity align |
| title | xStripeMerge: efficient wide stripe generation approach based on erasure coding storage |
| title_full | xStripeMerge: efficient wide stripe generation approach based on erasure coding storage |
| title_fullStr | xStripeMerge: efficient wide stripe generation approach based on erasure coding storage |
| title_full_unstemmed | xStripeMerge: efficient wide stripe generation approach based on erasure coding storage |
| title_short | xStripeMerge: efficient wide stripe generation approach based on erasure coding storage |
| title_sort | xstripemerge efficient wide stripe generation approach based on erasure coding storage |
| topic | distributed storage erasure coding wide stripe stripe merge parity align |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023217/ |
| work_keys_str_mv | AT meiguangzheng xstripemergeefficientwidestripegenerationapproachbasedonerasurecodingstorage AT taofeihua xstripemergeefficientwidestripegenerationapproachbasedonerasurecodingstorage AT xinyuzhang xstripemergeefficientwidestripegenerationapproachbasedonerasurecodingstorage AT zhiganghu xstripemergeefficientwidestripegenerationapproachbasedonerasurecodingstorage |