{'fraction_non_alphanumeric': 0.007125890736342043, 'fraction_numerical': 0.0, 'mean_word_length': 5.298507462686567, '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}}
Tree Shaped Computations as a Model for Parallel Applications

It is shown how a large class of applications can be parallelized by modeling them as tree shaped computations. In particular this class contains many highly irregular and completely unpredictable computations as they occur in heuristic search. We explain why the model even remains useful in the presence of some frequently observed subproblem dependencies.