{'fraction_non_alphanumeric': 0.016339869281045753, 'fraction_numerical': 0.0, 'mean_word_length': 5.13, '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}}
Modified bully election algorithm in distributed systems

Leader election is a fundamental problem in distributed computing, and regards a wide number of applications. In order to solve this problem, it is possible and convenient to exploit the topological properties of the specific distributed systems, so to reduce time and message complexity. In this paper we explain Garcia Molina's bully algorithm and indicate the problem of this algorithm and modify the bully algorithm. We show that modify algorithm is more efficient than the Garcia Molina's one in the time, message complexity and in the fewer stages.