{'fraction_non_alphanumeric': 0.024360535931790498, 'fraction_numerical': 0.0, 'mean_word_length': 5.2748091603053435, '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}}
Load Balancing Policies for Nested Fork-Join

Irregularity in parallel programs is often tackled by dynamic load balancing. Two well-known techniques, namely work sharing and work stealing, were recently combined into a hybrid scheme, which uses the former for shared-memory, and the latter for distributed-memory load balancing.Nested fork-join programs are an important type of task-based parallel programs, where tasks generate child tasks giving rise to an execution tree. The hybrid scheme was originally designed for a different task model. We transfer the hybrid scheme to nested fork-join programs, and compare different variants of the scheme, called load balancing policies. Experimental results show that the considered policies perform well for the used benchmarks with no significant difference between them.