@TechReport{ap:workload-tr,
  author = {Apratim Purakayastha and Carla Schlatter Ellis and David Kotz and
  Nils Nieuwejaar and Michael Best},
  title = {Characterizing Parallel File-Access Patterns on a Large-Scale
  Multiprocessor},
  year = {1994},
  month = {October},
  number = {CS-1994-33},
  institution = {Dept. of Computer Science, Duke University},
  copyright = {the authors},
  later = {ap:workload},
  URL = {ftp://ftp.cs.duke.edu/pub/dist/techreport/1994/1994-33.ps.Z},
  URLpdf = {http://www.cs.dartmouth.edu/~dfk/papers/ap:workload-tr.pdf},
  keywords = {parallel I/O, file access pattern, multiprocessor file system,
  file system workload, dfk, pario-bib},
  abstract = {Rapid increases in the computational speeds of multiprocessors
  have not been matched by corresponding performance enhancements in the I/O
  subsystem. To satisfy the large and growing I/O requirements of some parallel
  scientific applications, we need parallel file systems that can provide
  high-bandwidth and high-volume data transfer between the I/O subsystem and
  thousands of processors. \par Design of such high-performance parallel file
  systems depends on a thorough grasp of the expected workload. So far there
  have been no comprehensive usage studies of multiprocessor file systems. Our
  CHARISMA project intends to fill this void. The first results from our study
  involve an iPSC/860 at NASA Ames. This paper presents results from a
  different platform, the CM-5 at the National Center for Supercomputing
  Applications. The CHARISMA studies are unique because we collect information
  about every individual read and write request and about the entire mix of
  applications running on the machines. \par The results of our trace analysis
  lead to recommendations for parallel file system design. First, the file
  system should support efficient concurrent access to many files, and I/O
  requests from many jobs under varying load condit ions. Second, it must
  efficiently manage large files kept open for long periods. Third, it should
  expect to see small requests, predominantly sequential access patterns,
  application-wide synchronous access, no concurrent file-sharing between jobs,
  appreciable byte and block sharing between processes within jobs, and strong
  interprocess locality. Finally, the trace data suggest that node-level write
  caches and collective I/O request interfaces may be useful in certain
  environments.},
  comment = {See also kotz:workload, nieuwejaar:strided.}
}