@InProceedings{drapeau:tape-stripe,
  author = {Ann L. Drapeau and Randy H. Katz},
  title = {Striping in Large Tape Libraries},
  booktitle = {Proceedings of Supercomputing '93},
  year = {1993},
  pages = {378--387},
  publisher = {IEEE Computer Society Press},
  address = {Portland, OR},
  keywords = {parallel I/O, pario-bib},
  comment = {RAID-3 striping across drives in a tape robot, using 3 data plus
  one parity. Tape-switch time is very high, ie, 4 minutes. Switching four
  tapes at the same time would only get a little overlap, because there is only
  one robot arm. Assume large request size. Striping is much faster when only
  one request is considered, but with many requests outstanding, response time
  goes way down due to limited concurrency. More readers with the same stripe
  group size alleviate the contention and allow concurrency. Faster readers is
  the most important thing to improve performance, more important than
  improving robot speed. As both speeds improve the benefit of striping
  diminishes. Seems like this could be expressed in a simple equation...}
}