@Article{corbett:jvesta,
  author = {Peter F. Corbett and Dror G. Feitelson},
  title = {The {Vesta} Parallel File System},
  journal = {ACM Transactions on Computer Systems},
  year = {1996},
  month = {August},
  volume = {14},
  number = {3},
  pages = {225--264},
  publisher = {ACM Press},
  earlier = {corbett:vesta},
  later = {corbett:bvesta},
  URL =
  {http://www.acm.org/pubs/citations/journals/tocs/1996-14-3/p225-corbett/#abstract},
  keywords = {multiprocessor file system, Vesta, parallel I/O, pario-bib},
  abstract = {The Vesta parallel file system is designed to provide parallel
  file access to application programs running on multicomputers with parallel
  I/O subsystems. Vesta uses a new abstraction of files: a file is not a
  sequence of bytes, but rather it can be partitioned into multiple disjoint
  sequences that are accessed in parallel. The partitioning--which can also be
  changed dynamically--reduces the need for synchronization and coordination
  during the access. Some control over the layout of data is also provided, so
  the layout can be matched with the anticipated access patterns. The system is
  fully implemented and forms the basis for the AIX Parallel I/O File System on
  the IBM SP2. The implementation does not compromise scalability or
  parallelism. In fact, all data accesses are done directly to the I/O node
  that contains the requested data, without any indirection or access to shared
  metadata. Disk mapping and caching functions are confined to each I/O node,
  so there is no need to keep data coherent across nodes. Performance
  measurements shown good scalability with increased resources. Moreover,
  different access patterns are show to achieve similar performance.},
  comment = {See also corbett:pfs, corbett:vesta*, feitelson:pario. This is the
  ultimate Vesta reference. There seem to be only a few small things that are
  completely new over what's been published elsewhere, although this
  presentation is much more complete and polished.}
}