{'fraction_non_alphanumeric': 0.01615508885298869, 'fraction_numerical': 0.0, 'mean_word_length': 5.883333333333334, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Real Time Snapshot Collection Algorithm for Mobile Distributed Systems with Minimum Number of Checkpoints

Checkpointing is an efficient way of implementing fault tolerance in distributed systems. Mobile computing raises many new issues, such as high mobility, lack of stable storage on mobile hosts (MHs), low bandwidth of wireless channels, limited battery life and disconnections that make the traditional checkpointing protocols unsuitable for such systems. Minimum process non-blocking coordinated checkpointing may be useful for mobile distributed system as this approach is domino-free, requires at most two checkpoints of each process on stable storage, forces only interacting processes to checkpoint and does not suspend their underlying computation during checkpointing. Sometimes, it also requires piggybacking of information onto normal messages, blocking of the underlying computation or taking some useless checkpoints. In this paper, we propose a non-blocking minimum process coordinated checkpointing algorithm that requires minimum bandwidth over wireless channels and does not requires any induced/forced or mutable checkpoints and reduce the height of checkpointing tree without taking any extra overhead in real time.