@Article{shen:dpfs,
  author = {Xiaohui H. Shen and Alok Choudhary},
  title = {A high-performance distributed parallel file system for
  data-intensive computations},
  journal = {Journal of Parallel and Distributed Computing},
  year = {2004},
  month = {September},
  volume = {64},
  number = {10},
  pages = {1157--1167},
  institution = {Northwestern Univ, Dept Elect \& Comp Engn, Ctr Parallel \&
  Distributed Comp, Evanston, IL 60208 USA; Northwestern Univ, Dept Elect \&
  Comp Engn, Ctr Parallel \& Distributed Comp, Evanston, IL 60208 USA},
  publisher = {ACADEMIC PRESS INC ELSEVIER SCIENCE},
  copyright = {(c)2004 Institute for Scientific Information, Inc.},
  URL = {http://dx.doi.org/10.1016/j.jpdc.2004.07.001},
  keywords = {distributed file system, parallel file system, striping,
  pario-bib},
  abstract = {One of the challenges brought by large-scale scientific
  applications is how to avoid remote storage access by collectively using
  sufficient local storage resources to hold huge amounts of data generated by
  the simulation while providing high-performance I/O. DPFS, a distributed
  parallel file system, is designed and implemented to address this problem.
  DPFS collects locally distributed and unused storage resources as a
  supplement to the internal storage of parallel computing systems to satisfy
  the storage capacity requirement of large-scale applications. In addition,
  like parallel file systems, DPFS provides striping mechanisms that divide a
  file into small pieces and distributes them across multiple storage devices
  for parallel data access. The unique feature of DPFS is that it provides
  three file levels with each file level corresponding to a file striping
  method. In addition to the traditional linear striping method, DPFS also
  provides a novel Multidimensional striping method that can solve performance
  problems of linear striping for many popular access patterns. Other issues
  such as load-balancing and user interface are also addressed in DPFS. (C)
  2004 Elsevier Inc. All rights reserved.}
}