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 FE family and FLazy-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.
|Number of pages||17|
|State||Published - May 2011|
Bibliographical noteFunding Information:
Manivannan is a recipient of the Faculty CAREER Award from the US National Science Foundation and is a senior member of the IEEE and a senior member of the ACM.
This material is based in part upon work supported by the US National Science Foundation under Grant No. IIS-0414791 . Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.
- Communication-induced checkpointing protocols
- Consistent global checkpoints
- Distributed systems
ASJC Scopus subject areas
- Modeling and Simulation
- Hardware and Architecture
- Computer Networks and Communications