Abstract
A disk array is a set of disk drives (and controller) which can automatically recover data when one (or more) disk drives in the set fails. One method used by disk arrays to achieve high availability at lower cost than mirroring is a parity technique. The main drawback of such arrays are that they need four disk accesses to update a data block-two to read old data and parity, and two to write new data and parity. The authors describe four new methods to improve the update performance of disk arrays that use the parity technique from four accesses to three and, in some cases, to two. All the schemes sacrifice disk storage efficiency for improved update performance by relaxing the requirement that the modified data and parity blocks be written back into their original locations. The best technique, called 'floating parity track', achieves much improved update performance while using only 1% more disk space than traditional arrays.

This publication has 3 references indexed in Scilit: