{'fraction_non_alphanumeric': 0.027428571428571427, 'fraction_numerical': 0.004571428571428572, 'mean_word_length': 5.687022900763359, '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}}
Optimization Algorithm for Divisible Load Scheduling on Heterogeneous Star Networks

Scheduling divisible loads on heterogeneous distributed computing systems is addressed in this paper. The platform considered here is more general and realistic, where processors are connected in star topology with arbitrary communication and computation speeds and non- zero start-up overheads. A new optimization algorithm, called WX-GA, is proposed to tackle the following four issues: (1) How many processors are needed in computation? (2) Finding the optimal distribution sequence among processors. (3) How much the load fraction should be assigned on each processor? (4) When workload is large enough, what is the sufficient and necessary condition for the minimum processing time? Finally, the experimental results indicate the efficiency and effectiveness of the proposed algorithm.