String layouts for a redundant array of inexpensive disks

@article{Newberg1994StringLF,
  title={String layouts for a redundant array of inexpensive disks},
  author={Lee Aaron Newberg and D. Wolfe},
  journal={Algorithmica},
  year={1994},
  volume={12},
  pages={209-224}
}
This article introduces the concept of abad square in aredundant array of inexpensive disks (RAID). Bad squares are used to prove upper limits on the reliability of the2d-parity arrangement when there is the possibility that astring of disks may fail simultaneously. Bad-square analysis motivates several optimal string layouts which achieve these limits. Bad squares also provide a means to calculate the mean time to data loss for a RAID layout, without the use of Monte Carlo simulation.