Improving the Speed of A Distributed Checkpointing Algorithm
Sachin K Garg · Open Scholarship Institutional Repository (Washington University in St. Louis) · 1993
This paper shows how Koo and Toueg's distributed checkpointing algorithm can be modified so as to substantially reduce the average message volume. It attempts to avoid O(n{squared}) messages by using dependency knowledge to reduce the number of checkpoint request messages. Lemmas on consistency and termination are also included.