{'fraction_non_alphanumeric': 0.01582591493570722, 'fraction_numerical': 0.0, 'mean_word_length': 5.285714285714286, '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}}
Checkpointing and Recovery Algorithms Using Mobile Agents on a Hamiltonian Topology

Traditional message passing based checkpointing and rollback recovery algorithms perform well for closely coupled systems. In wide area distributed systems these algorithms may incur large overhead due to message passing delay and network traffic. So to design checkpointing and rollback recovery algorithms for wide area distributed systems, mobile agents are introduced. Network topology is assumed to be an arbitrary hamiltonian graph. Processes are mobile agent enabled. When a process wants to take a checkpoint or is restored after fault, it just creates two mobile agents. The rest of the work of creating a consistent global state (CGS) for checkpointing or finding a CGS in case of recovery, is performed by the mobile agents. In the worst case, for concurrent initiations among processes, checkpointing algorithm takes mobile agent movements. A mobile agent carries size data irrespective of the number of processes.