@InProceedings{miller:rama,
  author = {Ethan L. Miller and Randy H. Katz},
  title = {{RAMA:} A File System for Massively-Parallel Computers},
  booktitle = {Proceedings of the Twelfth IEEE Symposium on Mass Storage
  Systems},
  year = {1993},
  pages = {163--168},
  later = {miller:rama2},
  keywords = {parallel I/O, multiprocessor file system, pario-bib},
  comment = {The multiprocessor's file system acts as a block cache for
  tertiary storage. Disk space is broken into ``lines'' of a few MB. Each line
  has a descriptor telling what blocks it has, and their status. (fileid,
  offset) hashed to find (disk, linenum). Intrinsic metadata stored at start of
  each file; positional metadata implicit in hashing, and line descriptors.
  Sequentiality parameter puts several blocks of a file in the same line, to
  improve medium-sized requests (otherwise generate lots of request-response
  net traffic). Not clear on best choice of size. No mention of atomicity wrt
  concurrent writes to same data. Blocks migrate to tertiary storage as they
  get old. Fetched on demand, by block (not file). Self-describing blocks have
  ids in block -- leads to screwy block sizes?}
}