Theoretical and experimental evaluation of communication-induced checkpointing protocols in and families

Communication-induced checkpointing (CIC) protocols help in bounding rollback propagation by ensuring that each checkpoint taken is useful, while at the same time allowing each process to take checkpoints independently. In this paper, we focus on the evaluation of CIC protocols belonging to two families, namely, the F E family and F Lazy - E family. We present both theoretical and experimental evaluation of the protocols belonging to these two families. The results of our experimental evaluation not only confirm the theoretical comparison but also reveals the fine differences between these protocols.