@InProceedings{scott:matrix,
  author = {David S. Scott},
  title = {Parallel {I/O} and Solving Out of Core Systems of Linear Equations},
  booktitle = {Proceedings of the 1993 DAGS/PC Symposium},
  year = {1993},
  month = {June},
  pages = {123--130},
  organization = {Dartmouth Institute for Advanced Graduate Studies},
  address = {Hanover, NH},
  keywords = {parallel I/O, scientific computing, matrix factorization, Intel,
  pario-bib},
  abstract = {Large systems of linear equations arise in a number of scientific
  and engineering applications. In this paper we describe the implementation of
  a family of disk based linear equation solvers and the required
  characteristics of the I/O system needed to support them.},
  comment = {Invited speaker. See also scott:solvers. This gives a very brief
  overview of Intel's block solver and slab solver, both out-of-core
  linear-systems solvers. He notes a few optimizations that had to be made to
  CFS to make it work: data and metadata needed to have equal priority in the
  cache, because often the (higher-priority) metadata was crowding out the
  data; and they had to restrict some files to small subsets of disks to reduce
  the contention for the cache at each I/O node caused by large groups of
  processors all requesting at the same time (see nitzberg:cfs for the same
  problem).}
}