@TechReport{wang:paging,
  author = {Kuei Yu Wang and Dan C. Marinescu},
  title = {An Analysis of the Paging Activity of Parallel Programs, Part {I}:
  Correlation of the Paging Activity of Individual Node Programs in the {SPMD}
  Execution Mode},
  year = {1994},
  month = {June},
  number = {CSD-TR-94-042},
  institution = {Purdue University},
  keywords = {parallel I/O, virtual memory, paging, characterization,
  pario-bib},
  comment = {They measured the paging behavior of programs running on a
  Paragon, and analyze the results. To do so, they sample the OSF paging
  statistics periodically. The general conclusions: they found a surprising
  amount of dissimilarity in the paging behaviors of nodes within the same
  program, both in terms of the amount of paging and the timing of peak paging
  activity. These characteristics do not bode well for systems that use gang
  scheduling, or applications that have a lot of barriers.}
}