@InProceedings{cormen:integrate,
  author = {Thomas H. Cormen and David Kotz},
  title = {Integrating Theory and Practice in Parallel File Systems},
  booktitle = {Proceedings of the 1993 DAGS/PC Symposium},
  year = {1993},
  month = {June},
  pages = {64--74},
  organization = {Dartmouth Institute for Advanced Graduate Studies},
  copyright = {the authors},
  address = {Hanover, NH},
  note = {Revised as Dartmouth PCS-TR93-188 on 9/20/94},
  later = {cormen:integrate-tr},
  URL = {http://www.cs.dartmouth.edu/~dfk/papers/cormen:integrate.ps.gz},
  URLpdf = {http://www.cs.dartmouth.edu/~dfk/papers/cormen:integrate.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 for the first time 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,
  and turning off parity, file caching, and prefetching. We summarize recent
  theoretical and empirical work that justifies the need for these
  capabilities. In addition, we sketch an organization for a parallel file
  interface with low-level primitives and higher-level operations.},
  comment = {Describing the file system capabilities needed by parallel I/O
  algorithms to effectively use a parallel disk system. Revised as Dartmouth
  PCS-TR93-188 (updated).}
}