@TechReport{cormen:integrate-tr,
  author = {Thomas H. Cormen and David Kotz},
  title = {Integrating Theory and Practice in Parallel File Systems},
  year = {1993},
  month = {March},
  number = {PCS-TR93-188},
  institution = {Dept. of Math and Computer Science, Dartmouth College},
  copyright = {the authors},
  note = {Revised 9/20/94},
  earlier = {cormen:integrate},
  URL = {https://digitalcommons.dartmouth.edu/cs_tr/80/},
  URLpdf = {http://www.cs.dartmouth.edu/~dfk/papers/cormen:integrate-tr.pdf},
  keywords = {parallel I/O, multiprocessor file systems, algorithm, file system
  interface, dfk, pario-bib},
  abstract = {Several algorithms for parallel disk systems have appeared in the
  literature recently, and they are asymptotically optimal in terms of the
  number of disk accesses. Scalable systems with parallel disks must be able to
  run these algorithms. We present a list of capabilities that must be provided
  by the system to support these optimal algorithms: control over declustering,
  querying about the configuration, independent I/O, turning off file caching
  and prefetching, and bypassing parity. We summarize recent theoretical and
  empirical work that justifies the need for these capabilities.},
  comment = {Describing the file system capabilities needed by parallel I/O
  algorithms to effectively use a parallel disk system. Cite cormen:integrate.}
}