@TechReport{arunagiri:2008:opportunistic-checkpoints,
  author = {Sarala Arunagiri and and John Daly and Patricia J. Teller and
  Seetharami Seelam and Ron A. Oldfield and Maria Ruiz Varela and Rolf Riesen},
  title = {Oppportunistic Checkpoint Intervals to Improve System Performance},
  year = {2008},
  month = {June},
  number = {UTEP-CS-08-24},
  address = {El Paso, TX},
  URL = {http://www.cs.utep.edu/vladik/2008/abstr08.html#24},
  keywords = {checkpoint latency, analytic modeling, performance modeling,
  pario-bib},
  abstract = {The massive scale of current and next-generation massively
  parallel processing (MPP) systems presents significant challenges related to
  fault tolerance. For applications that perform periodic checkpoints, the
  choice of the checkpoint interval, the period between checkpoints, can have a
  significant impact on the execution time of the application. Finding the
  optimal checkpoint interval that minimizes the wall clock execution time, has
  been a subject of research over the last decade. In an environment where
  there are concurrent applications competing for access to the network and
  storage resources, in addition to application execution times, contention at
  these shared resources need to be factored into the process of choosing
  checkpoint intervals. In this paper, we perform analytical modeling of a
  complementary performance metric - the aggregate number of checkpoint I/O
  operations. We then show the existence and characterize a range of checkpoint
  intervals which have a potential of improving application and system
  performance.}
}