tolerating multiple failures in raid architectures with optimal storage and uniform declustering
We present D ATUM , a novel method for tolerating multiple disk failures in disk arrays. D ATUM is the first known method that can mask any given number of failures, requires an optimal amount of redundant storage space, and spreads reconstruction accesses uniformly over disks in the presence of failures without needing large layout tables in controller memory. Our approach is based on information dispersal, a coding technique that admits an efficient hardware implementation. As the method does not restrict the configuration parameters of the disk array, many existing RAID organizations are particular cases of D ATUM . A detailed performance comparison with two other approaches shows that D ATUM'S response times are similar to those of the best competitor when two or less disks fail, and that the performance degrades gracefully when more than two disks fail.
failure raid architecture optimality storage method arrays redundancy space reconstruction presence layout tables control memorialized informal code efficiency hardware implementation configurability organization performance comparisons response time