{'fraction_non_alphanumeric': 0.012180267965895249, 'fraction_numerical': 0.0, 'mean_word_length': 5.682926829268292, '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}}
Performance analysis of greedy Load balancing algorithms in Heterogeneous Distributed Computing System

The Load balancing problem on Heterogeneous Distributed Computing System (HDCS) deals with allocation of tasks to compute nodes, so that computing nodes are evenly loaded. Dynamic load balancing problem to assign tasks on HDCS is presented as a linear programming problem to minimize the makespan. Different greedy resource allocation algorithms are presented for load balancing on HDCS with tasks as Expected Time to Compute(ETC) matrix. The relative performance of the four heuristic algorithms under different circumstances has been simulated on two different HDCS using in house simulator. The simulation results show that the greedy based scheduling policy has the significant impact on the system heterogeneity.