An alternative decoding algorithm for EVENODD code in raid architectures

Chih Shing Tau; Tzone-I Wang

An alternative decoding algorithm for EVENODD code in raid architectures

Department of Engineering Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

EVENODD scheme is an efficient parity placement scheme for tolerating double disk failures in RAID (Redundant Arrays of Inexpensive Disks) architectures, and the codes of the EVENODD scheme are also optimal block codes based on exclusive-OR operations which making the complexity of the EVENODD scheme more simpler than other schemes that requires computation over finite fields. In this paper, we presented an alternative decoding algorithm for EVENODD code. Compared with EVENODD, the algorithm can reconstruct straightforwardly up to two faulty disks without increasing the computational complexity of the code. Moreover, some steps of the decoding procedure can be processed in parallel, with equivalent hardware to the encoding, without additional hardware. It can recover rapidly from any two disk failures.

Original language	English
Title of host publication	21st IASTED International Multi-Conference on Applied Informatics
Pages	887-892
Number of pages	6
Publication status	Published - 2003 Dec 1
Event	21st IASTED International Multi-Conference on Applied Informatics - Innsbruck, Austria Duration: 2003 Feb 10 → 2003 Feb 13

Publication series

Name	IASTED International Multi-Conference on Applied Informatics
Volume	21

Other

Other	21st IASTED International Multi-Conference on Applied Informatics
Country/Territory	Austria
City	Innsbruck
Period	03-02-10 → 03-02-13

All Science Journal Classification (ASJC) codes

Computer Science(all)

Cite this

@inproceedings{f092f600d18244ec8fe7053ad5c4ea75,

title = "An alternative decoding algorithm for EVENODD code in raid architectures",

abstract = "EVENODD scheme is an efficient parity placement scheme for tolerating double disk failures in RAID (Redundant Arrays of Inexpensive Disks) architectures, and the codes of the EVENODD scheme are also optimal block codes based on exclusive-OR operations which making the complexity of the EVENODD scheme more simpler than other schemes that requires computation over finite fields. In this paper, we presented an alternative decoding algorithm for EVENODD code. Compared with EVENODD, the algorithm can reconstruct straightforwardly up to two faulty disks without increasing the computational complexity of the code. Moreover, some steps of the decoding procedure can be processed in parallel, with equivalent hardware to the encoding, without additional hardware. It can recover rapidly from any two disk failures.",

author = "Tau, {Chih Shing} and Tzone-I Wang",

year = "2003",

month = dec,

day = "1",

language = "English",

isbn = "0889863415",

series = "IASTED International Multi-Conference on Applied Informatics",

pages = "887--892",

booktitle = "21st IASTED International Multi-Conference on Applied Informatics",

note = "21st IASTED International Multi-Conference on Applied Informatics ; Conference date: 10-02-2003 Through 13-02-2003",

}

TY - GEN

T1 - An alternative decoding algorithm for EVENODD code in raid architectures

AU - Tau, Chih Shing

AU - Wang, Tzone-I

PY - 2003/12/1

Y1 - 2003/12/1

N2 - EVENODD scheme is an efficient parity placement scheme for tolerating double disk failures in RAID (Redundant Arrays of Inexpensive Disks) architectures, and the codes of the EVENODD scheme are also optimal block codes based on exclusive-OR operations which making the complexity of the EVENODD scheme more simpler than other schemes that requires computation over finite fields. In this paper, we presented an alternative decoding algorithm for EVENODD code. Compared with EVENODD, the algorithm can reconstruct straightforwardly up to two faulty disks without increasing the computational complexity of the code. Moreover, some steps of the decoding procedure can be processed in parallel, with equivalent hardware to the encoding, without additional hardware. It can recover rapidly from any two disk failures.

AB - EVENODD scheme is an efficient parity placement scheme for tolerating double disk failures in RAID (Redundant Arrays of Inexpensive Disks) architectures, and the codes of the EVENODD scheme are also optimal block codes based on exclusive-OR operations which making the complexity of the EVENODD scheme more simpler than other schemes that requires computation over finite fields. In this paper, we presented an alternative decoding algorithm for EVENODD code. Compared with EVENODD, the algorithm can reconstruct straightforwardly up to two faulty disks without increasing the computational complexity of the code. Moreover, some steps of the decoding procedure can be processed in parallel, with equivalent hardware to the encoding, without additional hardware. It can recover rapidly from any two disk failures.

UR - http://www.scopus.com/inward/record.url?scp=1442351236&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1442351236&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:1442351236

SN - 0889863415

T3 - IASTED International Multi-Conference on Applied Informatics

SP - 887

EP - 892

BT - 21st IASTED International Multi-Conference on Applied Informatics

T2 - 21st IASTED International Multi-Conference on Applied Informatics

Y2 - 10 February 2003 through 13 February 2003

ER -

An alternative decoding algorithm for EVENODD code in raid architectures

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this