{'fraction_non_alphanumeric': 0.01641025641025641, 'fraction_numerical': 0.0, 'mean_word_length': 5.138364779874214, '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}}
Reliable Termination Detection Algorithm in Dynamic Distributed System

In this paper, we present a symmetric, fault tolerant algorithm for detecting termination in dynamic distributed system. An important problem in the area of distributed computing is distributed termination detection (DTD). The problem has been well studied in static systems. Anyhow not much work has been done in dynamic systems. When dynamic systems are considered active processes may create other processes. In that situation our new algorithm will detect termination. The algorithm detects a terminated status by checking the status of the root node. The algorithm will detect a weak termination in the presence of faulty nodes. Even when some of the nodes fail, then the non faulty nodes can continue their local computation and inform the root about their terminated status. Basic idea adopted is diffusing computation. Another significance of our algorithm is no restriction to network topology.