Computation algorithms for workload-dependent optimal checkpoint placement

In this paper we revisit a checkpoint/restart model by Slim et al (A new flexible 542 checkpoint/restart model, INRIA Technical Report, 6751, Centre 543 de recherche INRIA Grenoble, 2008) and derive the workload-dependent optimal checkpoint placement policies. Two cases are considered, where the system overhead parameters are independent and dependent of the cumulative workload. It is shown that the periodic and aperiodic checkpoint placement policies are always optimal in independent and dependent cases respectively, in terms of the minimization of expected total processing time. We provide the Lagrange algorithms to determine the optimal checkpoint sequences in the respective cases. Numerical examples are presented to investigate the sensitivity of system-failure parameter on the optimal checkpoint placement.