@techreport{TR-IC-01-17,
  number = {IC-01-17},
  author = {Islene Calciolari Garcia and Luiz Eduardo Buzato},
  title = {A Linear Approach to Enforce the Minimal Characterization of the Rollback-Dependency Trackability Property},
  month = {December},
  year = {2001}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 20 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      A checkpointing protocol that enforces rollback-dependency
      trackability (RDT) during the progress of a distributed computation
      must take forced checkpoints to break non-trackable
      dependencies.  Breaking just non-visibly doubled dependencies instead
      of breaking all non-trackable dependencies leads to fewer forced
      checkpoints, but seemed to require the processes of a computation to
      maintain and propagate $O(n^2)$ control information. In this paper, we
      prove that this hypothesis is false by presenting a protocol that
      breaks the minimal set of non-visibly doubled dependencies necessary
      to enforce RDT, called ``non-visibly doubled PMM-paths'', using only
      $O(n)$ control information.
  }
}