@InProceedings{lee:petal,
  author = {Edward K. Lee and Chandramohan A. Thekkath},
  title = {Petal: Distributed Virtual Disks},
  booktitle = {Proceedings of the Seventh International Conference on
  Architectural Support for Programming Languages and Operating Systems},
  year = {1996},
  month = {October},
  pages = {84--92},
  address = {Cambridge, MA},
  URL =
  {http://www.research.digital.com/SRC/personal/Chandu_Thekkath/Papers/petal-asplos96.ps},
  keywords = {parallel I/O, distributed file system, declustering, reliability,
  pario-bib},
  comment = {They are trying to build a file server that is easier to manage
  than most of today's distributed file systems, because disks are cheap but
  management is expensive. They describe a distributed file server that spreads
  blocks of all files across many disks and many servers. They use chained
  declustering so that they can survive loss of server or disk. They
  dynamically balance load. They dynamically reconfigure when new virtual disks
  are created or new physical disks are added. They've built it all and are now
  going to look at possible file systems that can take advantage of the
  features of Petal.}
}