{'fraction_non_alphanumeric': 0.026627218934911243, 'fraction_numerical': 0.0073964497041420114, 'mean_word_length': 4.991150442477876, '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}}
Parallel skeletons for divide-and-conquer and branch-and-bound techniques

The article describes the parallel implementation of skeletons for the divide-and-conquer and branch-and-bound techniques. The user has to choose a paradigm and has to specify for it the type of the problem, the type of solution and the specific characteristics of the technique using the C++ programming language. This information is combined with the provided resolution skeleton to obtain a sequential program and a parallel program. The paper describes the parallel implementation of the skeletons using MPI. Computational results on a Linux-cluster of PCs, Cray T3E and Origin 3000 are presented.