STRING LAYOUTS FOR A REDUNDANT ARRAY OF INEXPENSIVE DISKS

Authors
NEWBERG L WOLFE D
Citation
L. Newberg et D. Wolfe, STRING LAYOUTS FOR A REDUNDANT ARRAY OF INEXPENSIVE DISKS, Algorithmica, 12(2-3), 1994, pp. 209-224
Citations number
8
Categorie Soggetti
Computer Sciences",Mathematics,Mathematics,"Computer Science Software Graphycs Programming
Journal title
Algorithmica → ACNP
ISSN journal
01784617
Volume
12
Issue
2-3
Year of publication
1994
Pages
209 - 224
Database
ISI
SICI code
0178-4617(1994)12:2-3<209:SLFARA>2.0.ZU;2-2
Abstract
This article introduces the concept of a bad square in a redundant arr ay of inexpensive disks (RAID). Bad squares are used to prove upper li mits on the reliability of the 2d-parity arrangement when there is the possibility that a string of disks may fail simultaneously. Bad-squar e analysis motivates several optimal string layouts which achieve thes e 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 simulat ion.