An XOR-based erasure-recovered algorithm for tolerating double disk failure in disk array systems

Authors:
Chih-Shing Tau
Affiliations:
Department of Information Management, Meiho Institute of Technology, Neipu Shiang, Taiwan, R.O.C.
Venue:
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Year:
2007

Citing 8
Cited 0

A case for redundant arrays of inexpensive disks (RAID)

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures

IEEE Transactions on Computers - Special issue on fault-tolerant computing
Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering

Proceedings of the 24th annual international symposium on Computer architecture
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Efficient Placement of Parity and Data to Tolerate Two Disk Failures in Disk Array Systems

IEEE Transactions on Parallel and Distributed Systems
Disk Striping

Proceedings of the Second International Conference on Data Engineering
Reliability Mechanisms for Very Large Storage Systems

MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
An XOR Based Reed-Solomon Algorithm for Advanced RAID Systems

DFT '04 Proceedings of the Defect and Fault Tolerance in VLSI Systems, 19th IEEE International Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an efficient erasure-recovered algorithm based on parity placement scheme, called Horizontal-Oblique Parity (HOP), for protecting against double disk failures in RAID-5 disk array systems. HOP keeps all data unencoded, and uses only exclusive-or (XOR) operations to compute parity. HOP is provably near optimal in computational complexity, both during encoding and reconstruction. It is optimal in the amount of redundant information stored and is sub-optimal in its accessing. HOP works within a single stripe of blocks of sizes normally used by file systems, databases, and disk arrays.