@InProceedings{abawajy:scheduling,
  author = {J. H. Abawajy},
  title = {Performance Analysis of Parallel {I/O} Scheduling Approaches on
  Cluster Computing Systems},
  booktitle = {Workshop on Parallel I/O in Cluster Computing and Computational
  Grids},
  year = {2003},
  month = {May},
  pages = {724--729},
  organization = {Carleton University},
  publisher = {IEEE Computer Society Press},
  address = {Tokyo},
  note = {Organized at the IEEE/ACM International Symposium on Cluster
  Computing and the Grid 2003},
  URL =
  {http://csdl.computer.org/comp/proceedings/ccgrid/2003/1919/00/19190724abs.htm},
  keywords = {parallel I/O, I/O scheduling algorithms, pario-bib},
  abstract = {As computation and communication hardware performance continue to
  rapidly increase, I/O represents a growing fraction of application execution
  time. This gap between the I/O subsystem and others is expected to increase
  in future since I/O performance is limited by physical motion. Therefore, it
  is imperative that novel techniques for improveing I/O performance be
  developed. Parallel I/O is a promising approach to alleviating this
  bottleneck. However, very little work exist with respect to scheduling
  parallel I/O operations explicitly. In this paper, we address the problem of
  effective management of parallel I/O in cluster computing systems by using
  appropriate I/O scheduling strategies. We propose two new I/O scheduling
  algorithms and compare them with two existing scheduling Approaches. The
  preliminary results show that the proposed policies outperform existing
  policies substantially.}
}