Jim Brady

dblp:20/3408 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › disk array
double disk failure tolerance
0.021995
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures · IEEE Trans. Computers 1995
EVENODD: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures · ISCA 1994
Storage systems › storage reliability
RAID
0.021995
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures · IEEE Trans. Computers 1995
EVENODD: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures · ISCA 1994
Storage systems
storage reliability
0.021995
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures · IEEE Trans. Computers 1995
EVENODD: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures · ISCA 1994
Coding theory › error-correcting codes › block codes
array codes
0.011995
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures · IEEE Trans. Computers 1995
Coding theory › error-correcting codes
erasure coding
0.011995
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures · IEEE Trans. Computers 1995
Storage systems › storage reliability
erasure coding
0.011994
EVENODD: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures · ISCA 1994
Storage systems › storage reliability › erasure coding
parity-based redundancy
0.011994
EVENODD: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures · ISCA 1994

Methods — techniques the papers use, named apart from their topics

reed-solomon comparison · 0.0exclusive-OR computation · 0.0finite field arithmetic · 0.0coding theory · 0.0
YearPublicationVenuePosition
1995 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.>
Mario Blaum, Jim Brady, Jehoshua Bruck, Jai Menon 0001
IEEE Trans. Computers2
1994 EVENODD: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures
abstract
Presents a novel method, called EVENODD, for tolerating up to two disk failures in RAID architectures. EVENODD is the first known scheme for tolerating double disk failures that is optimal with regard to both storage and performance. EVENODD employs the addition of only two redundant disks and consists of simple exclusive-OR computations. 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 only previously known scheme that employs optimal redundant storage (i.e. two extra disks) is based on Reed-Solomon (RS) error-correcting codes, requires computation over finite fields and results in a more complex implementation. For example, the authors show that the number of exclusive-OR operations involved in implementing EVENODD in a disk array with 15 disks is about 50% of the number required when using the RS scheme.>
Mario Blaum, Jim Brady, Jehoshua Bruck, Jai Menon 0001
ISCA2