Volume 8 Number 11 (Nov. 2013)
Home > Archive > 2013 > Volume 8 Number 11 (Nov. 2013) >
JCP 2013 Vol.8(11): 2902-2907 ISSN: 1796-203X
doi: 10.4304/jcp.8.11.2902-2907

An Efficient MDS Array Code on Toleration Triple Node Failures in Storage System

Wunan Wan and Wang Suo
Network Engineering Department, ChengDu University of Information Technology,Cheng’Du, P. R. China

Abstract—Proper data placement schemes based on erasure correcting code are one of the most important components for a highly available data storage system. A new class of Maximum Distance Separable (MDS) array codes is presented for correcting triple storage failures, which is an extension of the double-erasure-correcting EVENODD code and is called the HDD-EOD code. The encoding and decoding procedures are described by geometrical line graph, which are easily implemented by soft hardware. Our analysis shows that the HDD-EOD code provides better decoding performance and higher reliability compared to other popular codes. Thus the HDD-EOD code is practically very meaningful for storage systems.

Index Terms—fault tolerance, high availability, MDS array codes, triple node failures

[PDF]

Cite: Wunan Wan and Wang Suo, " An Efficient MDS Array Code on Toleration Triple Node Failures in Storage System," Journal of Computers vol. 8, no. 11, pp. 2902-2907, 2013.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>