@Article{schwabe:jlayouts,
  author = {Eric J. Schwabe and Ian M. Sutherland and Bruce K. Holmer},
  title = {Evaluating Approximately Balanced Parity-Declustered Data Layouts
  for Disk Arrays},
  journal = {Parallel Computing},
  year = {1997},
  month = {June},
  volume = {23},
  number = {4},
  pages = {501--523},
  publisher = {North-Holland (Elsevier Scientific)},
  earlier = {schwabe:layouts},
  keywords = {disk array, parity, RAID, parallel I/O, pario-bib},
  abstract = {Parity-declustered data layouts were developed to reduce the time
  for on-line failure recovery in disk arrays. They generally require perfect
  balancing of reconstruction workload among the disks; this restrictive
  balance condition makes such data layouts difficult to construct. In this
  paper, we consider approximately balanced data layouts, where some variation
  in the reconstruction workload over the disks is permitted. Such layouts are
  considerably easier to construct than perfectly balanced layouts. We consider
  three methods for constructing approximately balanced data layouts, and
  analyze their performance both theoretically and experimentally. We conclude
  that on uniform workloads, approximately balanced layouts have performance
  nearly identical to that of perfectly balanced layouts.}
}