A Case Study of Performance Evaluation for RAID-Coded Storage Systems

2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) Pub Date : 2016-12-01 DOI:10.1109/PDCAT.2016.071

Ping Xie, Shengling Geng, Yinghua Tong

{"title":"A Case Study of Performance Evaluation for RAID-Coded Storage Systems","authors":"Ping Xie, Shengling Geng, Yinghua Tong","doi":"10.1109/PDCAT.2016.071","DOIUrl":null,"url":null,"abstract":"RAID codes are extensive developed to supply high reliability and high available for storage systems in modern data center. For example, RAID-0, RAID-4, RAID-5 and RAID-6 are wide deployed in in-production storage systems, of which RAID-6 codes are popular with the ability for tolerate two-diskfailure. The paper focus on performance evaluation of storage systems powered by RAID-6, firstly propose an analytical model to measure encoding, decoding and updating complexity, which is translated into XOR operation numbers for storage systems, and quantify the complexity of RDP and RP-RDP (i.e., two RAID-6 data layout schemes) using the formulated analytical model. Computational complexity of RAID code can significantly influence the write performance of storage systems, i.e., optimal computational complexity achieve better storage performance. The numerical results show RP-RDP, with optimal updating complexity, achieve better I/O balancing than RDP. For example, RP-RDP speeds up the load balancing ratio of RDP by a factor of up to 2.95 in the case of Random-SW.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2016.071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

RAID codes are extensive developed to supply high reliability and high available for storage systems in modern data center. For example, RAID-0, RAID-4, RAID-5 and RAID-6 are wide deployed in in-production storage systems, of which RAID-6 codes are popular with the ability for tolerate two-diskfailure. The paper focus on performance evaluation of storage systems powered by RAID-6, firstly propose an analytical model to measure encoding, decoding and updating complexity, which is translated into XOR operation numbers for storage systems, and quantify the complexity of RDP and RP-RDP (i.e., two RAID-6 data layout schemes) using the formulated analytical model. Computational complexity of RAID code can significantly influence the write performance of storage systems, i.e., optimal computational complexity achieve better storage performance. The numerical results show RP-RDP, with optimal updating complexity, achieve better I/O balancing than RDP. For example, RP-RDP speeds up the load balancing ratio of RDP by a factor of up to 2.95 in the case of Random-SW.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

raid编码存储系统性能评估案例研究

为了满足现代数据中心存储系统的高可靠性和高可用性，RAID码得到了广泛的发展。例如，在生产存储系统中广泛部署了RAID-0、RAID-4、RAID-5和RAID-6，其中RAID-6代码由于能够容忍双磁盘故障而广受欢迎。本文以RAID-6驱动的存储系统的性能评价为研究对象，首先提出了编码、解码和更新复杂度的分析模型，将编码、解码和更新复杂度转化为存储系统的异或运算数，并利用该分析模型对两种RAID-6数据布局方案RDP和RP-RDP的复杂度进行量化。RAID代码的计算复杂度会显著影响存储系统的写性能，即最优的计算复杂度可以获得更好的存储性能。数值结果表明，RP-RDP比RDP具有更好的I/O平衡，更新复杂度最优。例如，在Random-SW的情况下，RP-RDP将RDP的负载均衡率提高了2.95倍。

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

求助全文

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

来源期刊

2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

自引率

0.00%

发文量