In this paper, we give an alternative proof of the necessary and sufficient condition for achieving optimal checkpoint garbage collection in distributed systems [9]. We show that, by formulating the recovery line calculation problem as a reachability analysis problem on a rollback-dependency graph, the proof can be greatly simplified. We also present a polynomial-time optimal garbage collection...