@InProceedings{wu:noncontiguous,
  author = {Jiesheng Wu and Pete Wyckoff and Dhabaleswar Panda},
  title = {Supporting efficient noncontiguous access in {PVFS} over
  {I}nfiniBand},
  booktitle = {Proceedings of the IEEE International Conference on Cluster
  Computing},
  year = {2003},
  month = {December},
  pages = {344--351},
  institution = {Ohio State Univ, Columbus, OH 43210 USA},
  publisher = {IEEE Computer Society Press},
  copyright = {(c)2004 Institute for Scientific Information, Inc.},
  address = {Hong Kong, China},
  URL =
  {http://nowlab.cis.ohio-state.edu/projects/mpi-iba/publication/wuj-cluster03.pdf},
  keywords = {noncontiguous access patterns, PVFS, Infiniband, RDMA,
  pario-bib},
  abstract = {Noncontiguous I/O access is the main access pattern in many
  scientific applications. Noncontiguity exists both in access to files and in
  access to target memory regions on the client. This characteristic imposes a
  requirement of native noncontiguous I/O access support in cluster file
  systems for high performance. In this paper we address noncontiguous data
  transmission between the client and the I/O server in cluster file systems
  over a high performance network. We propose a novel approach, RDMA
  Gather/Scatter, to transfer noncontiguous data for such I/O accesses. We also
  propose a new scheme, Optimistic Group Registration, to reduce memory
  registration costs associated with this approach. We have designed and
  incorporated this approach in a version of PVFS over InfiniBand. Through a
  range of PVFS and MPI-IO micro-benchmarks, and the NAS BTIO benchmark, we
  demonstrate that our approach attains significant performance gains compared
  to other existing approaches.}
}