Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 1995 | Published
Journal Article Open

EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures

Abstract

We present a novel method, that we call EVENODD, for tolerating up to two disk failures in RAID architectures. EVENODD employs the addition of only two redundant disks and consists of simple exclusive-OR computations. This redundant storage is optimal, in the sense that two failed disks cannot be retrieved with less than two redundant disks. A major advantage of EVENODD is that it only requires parity hardware, which is typically present in standard RAID-5 controllers. Hence, EVENODD can be implemented on standard RAID-5 controllers without any hardware changes. The most commonly used scheme that employes optimal redundant storage (i.e., two extra disks) is based on Reed-Solomon (RS) error-correcting codes. This scheme requires computation over finite fields and results in a more complex implementation. For example, we show that the complexity of implementing EVENODD in a disk array with 15 disks is about 50% of the one required when using the RS scheme. The new scheme is not limited to RAID architectures: it can be used in any system requiring large symbols and relatively short codes, for instance, in multitrack magnetic recording. To this end, we also present a decoding algorithm for one column (track) in error.

Additional Information

© 1994 IEEE. Manuscript received November 29, 1993; revised April II, 1994. Date of Current Version: 06 August 2002. This paper was presented in part at the International Symposium in Computer Architecture (ISCA), Chicago, IL, April 1994. We are grateful to the reviewers for their useful comments that helped in improving the presentation.

Attached Files

Published - BLAieeetc95a.pdf

Files

BLAieeetc95a.pdf
Files (904.5 kB)
Name Size Download all
md5:eb0e9c86c36bceebff992b2aa0c5e309
904.5 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 24, 2023