Uncomplicated recovering algorithm based on dual parity placement scheme in disk array systems

Authors:
Chih-Shing Tau
Affiliations:
Department of Information Management, Meiho Institute of Technology, Pingtung County, Taiwan, Republic of China
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 7
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
Disk arrays: high-performance, high-reliability storage subsystems

Computer
RAID: high-performance, reliable secondary storage

ACM Computing Surveys (CSUR)
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures

IEEE Transactions on Computers - Special issue on fault-tolerant computing
Declustered disk array architectures with optimal and near-optimal parallelism

Proceedings of the 25th annual international symposium on Computer architecture
Efficient parity placement schemes for tolerating up to two disk failures in disk arrays

Journal of Systems Architecture: the EUROMICRO Journal
Efficient Placement of Parity and Data to Tolerate Two Disk Failures in Disk Array Systems

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an improved and intuitional dual parity placement scheme to enhance the reliability of a disk array system. The presented scheme can tolerate up to two disk failures by using two types of parity information in a matrix of disk block partitions. This scheme can reduce the occurrences of the bottleneck partially because the diagonal parity stripe units are uniformly distributed over the disk array. The encoding algorithm of this scheme is simple and many of the steps of the recovering algorithms can be executed in parallel. This scheme enables a disk array to recover rapidly from any two disk failures, with a single algorithm applied straightforwardly.