Optimal restart times for moments of completion time

Restart is an application-level technique that speeds up jobs with highly variable completion times. The authors present an efficient iterative algorithm to determine the restart strategy that minimises higher moments of completion time, when the total number of restarts is finite. They demonstrate its computational efficiency in comparison with alternative algorithms. They also discuss fast approximations to determine close to optimal restart times for limiting cases.