@InProceedings{miller:rama2,
  author = {Ethan L. Miller and Randy H. Katz},
  title = {{RAMA}: Easy Access to a High-Bandwidth Massively Parallel File
  System},
  booktitle = {Proceedings of the 1995 USENIX Technical Conference},
  year = {1995},
  month = {January},
  pages = {59--70},
  earlier = {miller:rama},
  later = {miller:jrama},
  keywords = {parallel file system, pario-bib},
  comment = {Simulation results. RAMA distributes blocks of each file randomly
  across disks, which are attached to all processor nodes, using a hash
  function. Thus there is no centralized metadata. The big benefit is uniform
  performance regardless of access pattern; they found one situation where it
  was 10\% slower than an optimal striped layout, but many cases where they
  were as much as 4 times faster than bad striped data layouts. So, they can
  give reasonable performance without the need for programmer- or
  manager-specified data layouts.}
}