DocumentCode
1814554
Title
Effect of data placement on the reliability of data storage systems
Author
Venkatesan, V.
Author_Institution
IBM Res. - Zurich, Rüschlikon, Switzerland
fYear
2013
fDate
1-5 July 2013
Firstpage
372
Lastpage
373
Abstract
Data redundancy, in the form of replication or advanced erasure codes, is used to protect data from storage node failures. It is known that that the placement of this redundant data across storage nodes can have a significant impact on the reliability, especially for large-scale storage systems. In particular, a declustered placement of redundant data is shown to have significantly higher reliability than the traditionally-used clustered placement for many redundancy schemes. This implies that significant gains in reliability can be obtained without losing storage efficiency by choosing the declustered placement scheme. Approximate expressions for the mean time to data loss of the system in terms of the various parameters of the system are obtained by considering the shortest paths to data loss when node failures occur and rebuild processes commence. These expressions are shown to hold true for parameters of practical interest through detailed event driven simulations.
Keywords
graph theory; reliability; storage management; approximate expressions; data loss; data protection; data redundancy; data storage systems; declustered placement scheme; erasure codes; event driven simulations; large-scale storage systems; redundant data placement; reliability; shortest paths; storage efficiency; storage node failures; system parameters; Correlation; Data models; Data storage systems; Distributed databases; Loss measurement; Redundancy;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing and Simulation (HPCS), 2013 International Conference on
Conference_Location
Helsinki
Print_ISBN
978-1-4799-0836-3
Type
conf
DOI
10.1109/HPCSim.2013.6641442
Filename
6641442
Link To Document