{'fraction_non_alphanumeric': 0.012486992715920915, 'fraction_numerical': 0.0, 'mean_word_length': 5.971014492753623, '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}}
New Benchmarks for Static Task Scheduling on Homogeneous Multiprocessor Systems with Communication Delays

Scheduling tasks on multiprocessor systems is a very active research area with numerous papers addressing the many different variants of the problem. Yet, there appears to be a lack of adequate benchmark problem instances. In this paper, we propose a large set of benchmark graphs for the Multiprocessor Scheduling Problem with Communication Delays. The proposed benchmark problems have known optimal solutions and cover a broad spectrum of characteristics: multiprocessor architecture, number of processors, number of tasks, density of inter-task communications links. We use these benchmark problem instances to analyze the performance of several constructive heuristics and may thus emphasize the dependency of constructive heuristic solutions on different problem parameters related to both task graph characteristics and multiprocessor architecture.