@InProceedings{madhyastha:informed,
  author = {Tara M. Madhyastha and Garth A. Gibson and Christos Faloutsos},
  title = {Informed Prefetching of Collective Input/Output Requests},
  booktitle = {Proceedings of SC99: High Performance Networking and Computing},
  year = {1999},
  month = {November},
  publisher = {ACM Press and IEEE Computer Society Press},
  address = {Portland, OR},
  URL = {http://www.sc99.org/proceedings/papers/madhyast.pdf},
  keywords = {informed prefetching, disk-directed I/O, parallel I/O,
  pario-bib},
  comment = {They argue that if enough application prefetches are made, a
  standard Unix interface will provide the same performance as a collective I/O
  interface. She uses simulation to show that if the file ordering is
  preserved, then the prefetch depth (the number of advance requests) is
  bounded by the number of disk drives. They look at two global access
  patterns: a simple interleaved sequential pattern and a 3-D block
  decomposition. Their experiment used 8 procs and 8 disks and did a comparison
  of the prefetching techniques to disk-directed I/O. Emperical studies showed
  that they needed a prefetch horizon of one to two times the number of disks
  to match the performance of disk-directed I/O, but the prefetching techniques
  require more memory.}
}