@InProceedings{corbett:vesta2,
  author = {Peter F. Corbett and Dror G. Feitelson and Jean-Pierre Prost and
  Sandra Johnson Baylor},
  title = {Parallel Access to Files in the {Vesta} File System},
  booktitle = {Proceedings of Supercomputing '93},
  year = {1993},
  pages = {472--481},
  publisher = {IEEE Computer Society Press},
  address = {Portland, OR},
  later = {corbett:jvesta},
  keywords = {multiprocessor file system, file checkpointing, Vesta,
  pario-bib},
  comment = {See also corbett:jvesta, corbett:vesta, corbett:vesta3,
  feitelson:pario. A new abstraction and a new interface. Typical systems use
  transparent striping, and access modes. They believe that ``optimization
  requires control''. Need to be able to tell the system what you want.
  User-defined or default. Asynch I/O. Concurrency control. Checkpointing.
  Export/import to external storage. New abstraction: file is multiple
  sequences of records. Each process sees a logical partition of the file.
  Physical partition is one or more disks. Logical partition defined in terms
  of records. Can repartition without moving data. Rectilinear decompositions
  of file data to processors. They can do gather/scatter requests. Using
  logical partitions give system the knowledge that user's accesses are
  disjoint. Collective operations with consistency checks, vs. independent
  access. Collective open defines logical view, then synch, then check that
  partitions are disjoint. If not, then they have access modes to define
  semantics (more or less the same as other systems). Consider this a target
  for HPF, etc. Physical partitioning (record size and number of partitions) is
  defined at create time. Can they have different physical or logical partition
  sizes in the same file? Future: parallel pipelines, ``out-of-core'' backing
  store for HPF arrays, high-level operations, collective operations.}
}

