{'fraction_non_alphanumeric': 0.023809523809523808, 'fraction_numerical': 0.0, 'mean_word_length': 5.118181818181818, '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}}
Cooperate and compete! A hybrid solving strategy for task-parallel SAT solving on Peer-to-Peer Desktop Grids

The presented work is part of our long-term research goal to develop parallel SAT solving methods for large scale Peer-to-Peer Desktop Grids, which aggregate globally distributed resources. In such a parallel environment, appropriate strategies for dealing with massive parallelism are necessary. In particular, efficiency and at the same time robustness of the parallel methods must be ensured. In this paper, we report on a hybrid strategy for parallel SAT Solving, which combines exploratory and competition parallelism in an adaptive way to meet these goals.