HVD code: a class of MDS array codes for tolerating triple disk failures

In this study, the authors propose a class of exclusive OR (XOR)-based maximum distance separable (MDS) array codes, referred to as horizontal-vertical-diagonal (HVD) codes, which can tolerate triple disk failures with optimal update complexity. The HVD code has a similar data/parity layout to the horizontal-vertical (HV) code and has many figures of merits as the HV code. Also, an efficient recovery algorithm is proposed, which can be implemented to accelerate the recovery process of double disk failures by making full use of all kinds of parities in the HVD code. The authors evaluate the encoding/decoding efficiency of the HVD code by comparing the number of XORs and the number of disk reads with other MDS array codes. Results show that the HVD code inherits most of the merits of the HV code and requires less number of disk reads when recovering single disk failure.

• Publication year

  2019

• Venue

  IET Communications

• Publication date

  2019-01-10

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1049/IET-COM.2018.6126
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• XI-Code: A Family of Practical Lowest Density MDS Array Codes of Distance 4

  2016cited by this paper
• HV Code: An All-Around MDS Code for RAID-6 Storage Systems

  2016cited by this paper
• Seek-Efficient I/O Optimization in Single Failure Recovery for XOR-Coded Storage Systems

  2015cited by this paper
• A case for redundant arrays of inexpensive disks (RAID)

  2015cited by this paper
• TIP-Code: A Three Independent Parity Code to Tolerate Triple Disk Failures with Optimal Update Complextiy

  2015cited by this paper
• A Comprehensive Analysis of XOR-Based Erasure Codes Tolerating 3 or More Concurrent Failures

  2013cited by this paper
• Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads

  2012cited by this paper
• On the speedup of single-disk failure recovery in XOR-coded storage systems: Theory and practice

  2012cited by this paper
• H-Code: A Hybrid MDS Array Code to Optimize Partial Stripe Writes in RAID-6

  2011cited by this paper
• Minimum density RAID-6 codes

  2011cited by this paper
• Windows Azure Storage: a highly available cloud storage service with strong consistency

  2011cited by this paper
• HDP code: A Horizontal-Diagonal Parity Code to Optimize I/O load balancing in RAID-6

  2011cited by this paper
• TRIPLE-STAR : A CODING SCHEME WITH OPTIMAL ENCODING COMPLEXITY FOR TOLERATING TRIPLE DISK FAILURES

  2011cited by this paper
• T-Code: 3-Erasure Longest Lowest-Density MDS Codes

  2010cited by this paper
• Optimal recovery of single disk failure in RDP code storage systems

  2010cited by this paper
• P-Code: a new RAID-6 code with optimal properties

  2009cited by this paper
• Disk Failures in the Real World: What Does an MTTF of 1, 000, 000 Hours Mean to You?

  2007cited by this paper
• A Family of MDS Array Codes with Minimal Number of Encoding Operations

  2006cited by this paper
• New efficient MDS array codes for RAID. Part II. Rabin-like codes for tolerating multiple (/spl ges/ 4) disk failures

  2005cited by this paper
• STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures

  2005cited by this paper
• WEAVER codes: highly fault tolerant erasure codes for storage systems

  2005cited by this paper
• Matrix methods for lost data reconstruction in erasure codes

  2005cited by this paper
• Awarded Best Paper! -- Row-Diagonal Parity for Double Disk Failure Correction

  2004cited by this paper
• Efficient parity placement schemes for tolerating triple disk failures in RAID architectures

  2003cited by this paper
• X-Code: MDS Array Codes with Optimal Encoding

  1999cited by this paper
• On Lowest Density MDS Codes

  1999cited by this paper
• EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures

  1995cited by this paper
• MDS array codes with independent parity symbols

  1995cited by this paper
• Polynomial Codes Over Certain Finite Fields

  1960cited by this paper

• No citing papers are available for this paper.