{'fraction_non_alphanumeric': 0.010330578512396695, 'fraction_numerical': 0.0, 'mean_word_length': 5.729166666666667, '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}}
Improving communication for distributed model checking

We examine the distributed breadth-first enumeration of a state space that is partitioned using a static partition function. Two of the key drawbacks of this approach are the high communication overhead and the excessive growth of the queues that hold states received from other nodes, ultimately resulting in memory exhaustion that causes premature termination of the distributed enumeration algorithm. This paper investigates a number of strategies to reduce communication times and queue lengths. Some aspects of the strategies are novel, including a local search technique, while others are standard techniques for reducing memory usage and time for both serial and parallel state enumeration algorithms. The queue reduction strategies effectively reduce the queue lengths and save memory, while the standard techniques outperform the other strategies in their effectiveness to reduce communication overhead.