{'fraction_non_alphanumeric': 0.007936507936507936, 'fraction_numerical': 0.0, 'mean_word_length': 4.926174496644295, '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}}
Optimized Bully Election Method for Selection of Coordinator Process and Recovery of Crashed Process

In distributed systems one process or a node is required in such a way that it can act as leader node or a coordinator. Election algorithms are meant for electing process or node that acts as leader node also called as coordinator from among currently alive processes such that at any instance of time there will be single coordinator for all the processes in the system. So, election algorithms are momentous in any distributed system. Bully algorithm is one of the standard approaches for electing the coordinator in distributed systems. In this paper, we have presented a bully algorithm that minimizes the number of messages while electing the new coordinator and when a process recovers from a crashed state in distributed systems and thus reduces the network traffic caused.