Low-Redundancy Two-Dimensional RAID Arrays

Appeared in Proceedings of the International Conference on Computing, Networking and Communications.

Abstract

Most extant two-dimensional RAID arrays tend to use a square matrix organization such that each row and each column of the array forms a parity stripe. These arrays require 2k parity disks to protect the contents of k^2 data disks against all double disk failures and most triple disk failures. We investigate the reliability of a lesser known organization that allows k parity disks to protect k(k – 1)/2 data disks against all double and most triple failures. We found that this organization can provide the same or better mean times to data loss (MTTDLs) than organiza- tions requiring more parity disks to protect the same number of data disks.

Publication date:
February 2012

Authors:
Jehan-François Pâris
Ahmed Amer
Thomas Schwarz

Projects:
Reliable Storage

Available media

Full paper text: PDF

Bibtex entry

@inproceedings{paris-icnc12,
  author       = {Jehan-François Pâris and Ahmed Amer and Thomas Schwarz},
  title        = {Low-Redundancy Two-Dimensional {RAID} Arrays},
  booktitle    = {Proceedings of the International Conference on Computing, Networking and Communications},
  month        = feb,
  year         = {2012},
}