Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems
Authors:
Open Access
- 1 January 2014
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 10 (1) , 1-17
Abstract
Traditionally, when storage systems employ erasure codes, they are designed to tolerate the failures of entire disks. However, the most common types of failures are latent sector failures, which only affect individual disk sectors, and block failures which arise through wear on SSD’s. This article introduces SD codes, which are designed to tolerate combinations of disk and sector failures. As such, they consume far less storage resources than traditional erasure codes. We specify the codes with enough detail for the storage practitioner to employ them, discuss their practical properties, and detail an open-source implementation.Keywords
Funding Information
- National Science Foundation (CSR-1128847)
- Division of Computer and Network Systems (CSR-1016636)
- International Business Machines Corporation
This publication has 30 references indexed in Scilit:
- Efficient software implementations of large finite fields GF (2
n
) for secure storage applicationsACM Transactions on Storage, 2012
- Differential RAIDACM Transactions on Storage, 2010
- POTSHARDS—a secure, recoverable, long-term archival storage systemACM Transactions on Storage, 2009
- GRID codesACM Transactions on Storage, 2009
- An analysis of data corruption in the storage stackACM Transactions on Storage, 2008
- A new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errorsACM Transactions on Storage, 2008
- On lowest density MDS codesIEEE Transactions on Information Theory, 1999
- A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systemsSoftware: Practice and Experience, 1997
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architecturesIEEE Transactions on Computers, 1995
- Beating the I/O bottleneck: a case for log-structured file systemsACM SIGOPS Operating Systems Review, 1989