Low Overhead Time Coordinated Checkpointing Algorithm For Mobile Distributed Systems

摘要

Two checkpointing approaches i.e., coordinated checkpointing and times based checkpointing are widely used in the literature of MDSs. Coordinated checkpointing protocols uses the less checkpoints and domino free but have large coordinated message overheads as processes synchronize by exchanging coordinated message. Time based approach has minimum coordinated messages overheads cost but has high checkpointing cost as it requires large number checkpoints than minimum. Hence coordinated checkpointing approach have minimum checkpointing cost than time based approach but higher coordinated message overheads cost which increases the checkpointing overheads. In this paper, we design an efficient time coordinated checkpointing algorithm which uses time to indirectly coordinate to minimize the number of coordinated message transmitted through the wireless link and reduces the number of checkpoints nearest to the minimum. The algorithm is non-blocking and minimum process.