Surviving a Disk Apocalypse with Single Overlap Declustered Parity
summary
Single-Overlap Declustered Parity (SODP) is a new declustered parity layout that arranges stripes into column- and row-based strip sets using permutations and rotations so any two disks overlap in at most one strip set, enabling a 2+2 erasure code to survive large correlated bursts. Evaluation on a 16-disk example uses 20 strip sets, shows 20x less data loss vs traditional declustered parity during burst failures and delivers almost identical rebuild times to state-of-the-art declustered rebuilds.
AI-written summary · about
chapters (11)
- 0:00Start
- 0:51Failure Bursts
- 1:38Empirical Failures
- 3:04Erasure Codes
- 3:52Traditional RAID
- 5:10Declustered Parity
- 7:02Probability of Data Loss (PDL)
- 7:35Single-Overlap Stripesets
- 9:13Multiple Disk Failures
- 11:22SODP Algorithm
- 23:15SODP Conclusion
related talks
17mOkapi: Decoupling Data Striping and Redundancy Grouping in Cluster File Systems
11mStripeless Data Placement for Erasure-Coded In-Memory Storage
11mExploiting Combined Locality for Wide-Stripe Erasure Coding in Distributed Storage
59mPractical Error Control Coding For Data Storage
06mNobody Knows What PGs are Good For, Only I Do
15mLESS is More for I/O-Efficient Repairs in Erasure-Coded Storage
24mPLOVER: Fast, Multi-core Scalable Virtual Machine Fault-tolerance
18mDayu: Fast and Low-interference Data Recovery in Very-large Storage Systems