{'fraction_non_alphanumeric': 0.017241379310344827, 'fraction_numerical': 0.006157635467980296, 'mean_word_length': 5.3515625, '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 the efficiency of functional parallelism by means of hyper-scheduling

By means of a comprehensive test bench of 36000 test cases we evaluated the efficiency of functional parallel programs. For all the test cases schedules have been computed by various well known heuristics. We assumed a homogeneous target system (e.g. a compute cluster of equally powerful interconnected nodes) that can be part of a grid computing environment which supports the execution of parallel programs. Unfortunately, the efficiencies of the investigated schedules were pretty low. For this reason, we propose a new hyper-scheduling approach that reduces the amount of idle times by interweaving subsequent schedules from the parallel job queue. First results confirm that hyper-scheduling significantly improves efficiency