Reliability and Failure Impact Analysis of Distributed Storage Systems with Dynamic Refuging

被引:0
作者
Akutsu, Hiroaki [1 ]
Ueda, Kazunori [2 ]
Chiba, Takeru [1 ]
Kawaguchi, Tomohiro [1 ]
Shimozono, Norio [1 ]
机构
[1] Hitachi Ltd, Res & Dev Grp, Yokohama, Kanagawa 2440817, Japan
[2] Waseda Univ, Tokyo 1698555, Japan
关键词
erasure coding; highly redundant storage systems; reliability; rebuild; Monte Carlo simulation; RAID;
D O I
10.1587/transinf.2016EDP7139
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent data centers, large-scale storage systems storing big data comprise thousands of large-capacity drives. Our goal is to establish a method for building highly reliable storage systems using more than a thousand low-cost large-capacity drives. Some large-scale storage systems protect data by erasure coding to prevent data loss. As the redundancy level of erasure coding is increased, the probability of data loss will decrease, but the increase in normal data write operation and additional storage for coding will be incurred. We therefore need to achieve high reliability at the lowest possible redundancy level. There are two concerns regarding reliability in large-scale storage systems: ( i) as the number of drives increases, systems are more subject to multiple drive failures and ( ii) distributing stripes among many drives can speed up the rebuild time but increase the risk of data loss due to multiple drive failures. If data loss occurs by multiple drive failure, it affects many users using a storage system. These concerns were not addressed in prior quantitative reliability studies based on realistic settings. In this work, we analyze the reliability of large-scale storage systems with distributed stripes, focusing on an effective rebuild method which we call Dynamic Refuging. Dynamic Refuging rebuilds failed blocks from those with the lowest redundancy and strategically selects blocks to read for repairing lost data. We modeled the dynamic change of amount of storage at each redundancy level caused by multiple drive failures, and performed reliability analysis with Monte Carlo simulation using realistic drive failure characteristics. We showed a failure impact model and a method for localizing the failure. When stripes with redundancy level 3 were sufficiently distributed and rebuilt by Dynamic Refuging, the proposed technique turned out to scale well, and the probability of data loss decreased by two orders of magnitude for systems with a thousand drives compared to normal RAID. The appropriate setting of a stripe distribution level could localize the failure.
引用
收藏
页码:2259 / 2268
页数:10
相关论文
共 18 条
[1]   Reliability Analysis of Highly Redundant Distributed Storage Systems with Dynamic Refuging [J].
Akutsu, Hiroaki ;
Ueda, Kazunori ;
Chiba, Takeru ;
Kawaguchi, Tomohiro ;
Shimozono, Norio .
23RD EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP 2015), 2015, :261-268
[2]  
[Anonymous], 2012, DIGITAL UNIVERSE 202
[3]  
[Anonymous], ACM QUEUE
[4]   EVENODD - AN EFFICIENT SCHEME FOR TOLERATING DOUBLE-DISK FAILURES IN RAID ARCHITECTURES [J].
BLAUM, M ;
BRADY, J ;
BRUCK, J ;
MENON, J .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (02) :192-202
[5]  
Blomer J., 1995, Tech. Rep. TR-95-048
[6]  
Conroy Matthew M., COLLECTION DICE PROB
[7]   Beyond MTTDL: A Closed-Form RAID 6 Reliability Equation [J].
Elerath, Jon G. ;
Schindler, Jiri .
ACM TRANSACTIONS ON STORAGE, 2014, 10 (02)
[8]   A Highly Accurate Method for Assessing Reliability of Redundant Arrays of Inexpensive Disks (RAID) [J].
Elerath, Jon G. ;
Pecht, Michael .
IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (03) :289-299
[9]  
Freitas R., 2011, GPFS scans 10 billion files in 43 minutes
[10]  
Gao Y., 2010, 5 IEEE INT C NETW AR, P126