{'fraction_non_alphanumeric': 0.032, 'fraction_numerical': 0.025333333333333333, 'mean_word_length': 5.7657657657657655, '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}}
Scheduling Tasks with Small Communication Delays for Clusters of Processors

We adopt the hierarchical communications model of (Bampis, Giroudeau, and König, 2000) and we present an approximation algorithm for the precedence constrained multiprocessor scheduling problem in the presence of small hierarchical communication delays (Chrétienne and Colin, 1991). Our algorithm is based on linear programming and rounding and has a performance guarantee of 12(Φ+1)/(12Φ+1) where Φ≥1 is the ratio of the smallest processing time of the tasks and of the maximum intercluster communication delay. This result generalizes the result of (Bampis, Giroudeau, and König, 2000) for the problem with unit execution times and unit intercluster communication delays.