@InProceedings{patterson:pdis-tip,
  author = {R. Hugo Patterson and Garth A. Gibson},
  title = {Exposing {I/O} Concurrency with Informed Prefetching},
  booktitle = {Proceedings of the Third International Conference on Parallel
  and Distributed Information Systems},
  year = {1994},
  month = {September},
  pages = {7--16},
  later = {patterson:informed},
  URL = {http://www.cs.cmu.edu/afs/cs/project/pdl/ftp/TIP/PDIS.ps},
  keywords = {prefetching, parallel I/O, pario-bib},
  abstract = {Informed prefetching provides a simple mechanism for
  I/O-intensive, cache-ineffective applications to efficiently exploit
  highly-parallel I/O subsystems such as disk arrays. This mechanism, dynamic
  disclosure of future accesses, yields substantial benefits over sequential
  readahead mechanisms found in current file systems for non-sequen tial
  workloads. This paper reports the performance of the Transparent Informed
  Prefetching system (TIP), a minimal prototype implemented in a Mach 3.0
  system with up to four disks. We measured reductions by factors of up to 1.9
  and 3.7 in the execution time of two example applications: multi-file text
  search and scientific data visualization.},
  comment = {Also available in HTML format at
  http://www.cs.cmu.edu/Web/Groups/PDL/HTML-Papers/PDIS94/final.fm.html.}
}