OPS: an optimized partial stripe write scheme to improve performance of XOR-based disk arrays tolerating triple disk failures

Proceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications Pub Date : 2019-03-08 DOI:10.1145/3318265.3318274

Xunsong Huang, Chentao Wu, Jie Li

{"title":"OPS: an optimized partial stripe write scheme to improve performance of XOR-based disk arrays tolerating triple disk failures","authors":"Xunsong Huang, Chentao Wu, Jie Li","doi":"10.1145/3318265.3318274","DOIUrl":null,"url":null,"abstract":"In cloud storage and big data processing systems, RAID especially disk arrays tolerating triple disk failures (3DFTs) is a popular choice to provide high reliability with low monetary cost. For 3DFTs, a key obstacle is the low partial stripe write performance, which is caused by large amount of parity modifications based on complex erasure coding layouts. In order to solve this problem, in this paper, we propose an optimized partial stripe write (OPS) method, which reorganizes the distribution of write data blocks to share partial parities among data blocks, thereby improving overall I/O performance. The OPS method can effectively reduce the number of modified parities. To illustrate the effectiveness of our OPS method, we used Disksim to evaluate several different partial stripe write methods through simulation. The results show that OPS can reduce the average response time by up to 37.21% and decreases the number of write operations by up to 26.22% compared to the traditional partial strip writing method..","PeriodicalId":241692,"journal":{"name":"Proceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3318265.3318274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

Abstract

In cloud storage and big data processing systems, RAID especially disk arrays tolerating triple disk failures (3DFTs) is a popular choice to provide high reliability with low monetary cost. For 3DFTs, a key obstacle is the low partial stripe write performance, which is caused by large amount of parity modifications based on complex erasure coding layouts. In order to solve this problem, in this paper, we propose an optimized partial stripe write (OPS) method, which reorganizes the distribution of write data blocks to share partial parities among data blocks, thereby improving overall I/O performance. The OPS method can effectively reduce the number of modified parities. To illustrate the effectiveness of our OPS method, we used Disksim to evaluate several different partial stripe write methods through simulation. The results show that OPS can reduce the average response time by up to 37.21% and decreases the number of write operations by up to 26.22% compared to the traditional partial strip writing method..

查看原文本刊更多论文

OPS:一种优化的部分分条写方案，用于提高基于xor的磁盘阵列在三盘故障情况下的性能

在云存储和大数据处理系统中，为了提供高可靠性和低成本，RAID特别是可容忍三盘故障的磁盘阵列是一种流行的选择。对于3dft来说，一个关键的障碍是部分条带写入性能较低，这是由于基于复杂的擦除编码布局的大量奇偶修改造成的。为了解决这一问题，本文提出了一种优化的部分分条写(partial stripe write, OPS)方法，该方法通过重新组织写数据块的分布，在数据块之间共享部分一致性，从而提高整体I/O性能。OPS方法可以有效地减少修改对的数量。为了说明我们的OPS方法的有效性，我们使用Disksim通过仿真来评估几种不同的部分条带写入方法。结果表明，与传统的部分条带写入方法相比，OPS可将平均响应时间缩短37.21%，将写入操作次数减少26.22%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications

自引率

0.00%

发文量