The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS
Transactions ID Number: 42-214
Full Name: Yulin Wang
Position: Doctor (Researcher)
Age: ON
Sex: Male
Address: No.4, Section 2, North Jianshe Road, Chengdu, P.R.China
Country: CHINA
Tel: 86-28-61830223
Tel prefix:
Fax:
E-mail address: wyl@uestc.edu.cn
Other E-mails: alasomn@google.com
Title of the Paper: MDS array codes with optimal encoding complexity for tolerating triple disk failures in RAID
Authors as they appear in the Paper: Yulin Wang, Guangjun Li
Email addresses of all the authors: wyl@uestc.edu.cn, gjli@uestc.edu.cn
Number of paper pages: 11
Abstract: Low encoding/decoding complexity is essential for practical storage systems. This paper presents a new MDS array codes, called Triple-Star, for tolerating triple disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is n*n, the size of the parity-check part is n*3, and the minimum distance is 4, where n is the number of information disks, the number of parity-check disks is 3, and (n+1) is a prime integer. We construct Triple-Star based on a bit matrix-vector product similar to the Reed-Solomon coding, and provide the geometry encoding method and detailed non-recursive decoding algorithms. The code rate is 3/(n+3) and the Maximum Distance Separable (MDS) property is proved. The key novelty in the presented codes is that it has optimal encoding and lower decoding complexity comparing with existing 3-column erasure codes.
Keywords: Array code; MDS; RAID; Efficient decoding; Decoding complexity; Tripe-disk fault-tolerance
EXTENSION of the file: .pdf
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress:
IP ADDRESS: 125.71.228.68
