Paper Info
Title
Progressive Parity-Based Hardening Of Data Stores
Abstract
We propose the use of parity-based redundant data layouts of increasing reliability as a means to progressively harden data archives. We evaluate the reliability of two such layouts and demonstrate how moving to layouts of higher parity degree offers a mechanism to progressively and dramatically increase the reliability of a multi-device data store. Specifically we propose that a data archive can be migrated to progressively more reliable layouts as the data ages, trading limited (and likely unrealized) increases in update costs for increased reliability. Our parity-based schemes are drawn from SSPiRAL (Survivable Storage using Parity in Redundant Array Layouts) that offer capacity efficiency equivalent to a straightforward mirroring arrangement. Our analysis shows our proposed schemes would utilize no additional physical resources and result in improvements to mean time to data loss of four to seven orders of magnitude.
Year
DOI
Venue
2008
10.1109/PCCC.2008.4745117
2008 IEEE INTERNATIONAL PERFORMANCE, COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC 2008)
Keywords
Field
DocType
maintenance engineering,layout,redundancy,parallel processing,reliability,mathematical model
Data mining,Computer science,Capacity efficiency,Parallel processing,Information storage,Real-time computing,Redundancy (engineering),Mean time to data loss,Parity (mathematics),Computer engineering,Data archive,Maintenance engineering
Conference
ISSN
Citations 
PageRank 
1097-2641
1
0.40
References 
Authors
10
4
Name
Order
Citations
PageRank
Ahmed Amer1365.67
Jehan-françois Pâris2510265.03
Darrell D. E. Long33111536.40
Thomas J. E. Schwarz419024.56