{'fraction_non_alphanumeric': 0.008928571428571428, 'fraction_numerical': 0.0, 'mean_word_length': 5.547445255474453, '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}}
Task Scheduling in Heterogeneous Computing Systems Using a MicroGA

The paper deals with the problem of scheduling precedence-constrained applications on a distributed heterogeneous computing system with the aim of minimizing the response time or total execution time. We design and investigate the effectiveness of a micro genetic algorithm based scheduling algorithm. Due to a lack of generally accepted standard benchmarks for the evaluation of scheduling algorithms in the heterogeneous computing systems we also generate a benchmark of synthetic instances. The benchmark is composed of small size synthetic deterministic non-preemptive program graphs proposed in the literature. We design a branch and bound algorithm to compute the optimal solution and the global optimal value. We compare the performance of the proposed microGA with the optimal values considering an approximation factor.