{'fraction_non_alphanumeric': 0.019948519948519948, 'fraction_numerical': 0.0, 'mean_word_length': 5.244979919678715, '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}}
Multiprocessor Task Graph Scheduling Using a Novel Graph-Like Learning Automata

Optimized task scheduling is one of the most important challenges in multiprocessor environments such as parallel and distributed systems. In such these systems, each parallel program is decomposed into the smaller segments so-called tasks. Task execution times, precedence constrains and communication costs are modeled by using a directed acyclic graph (DAG) named task graph. The goal is to minimize the program finish-time (makespan) by means of mapping the tasks to the processor elements in such a way that precedence constrains are preserved. This problem is shown to be NP-hard in general form and some restricted ones. Therefore, utilization of heuristic and meta-heuristic approaches to solve this problem is logical. Learning automata (LA) is an abstract model to interact with stochastic environment, which tries to reform itself based on the environment feedback. Although a learning automaton itself is a simple component, a group of them by cooperating each other can show complicated behavior, and can coverage to desired solutions under appropriate learning algorithm. In this paper, an ingenious graph-like learning automata in which each task in the task graph is represented by a learning automaton tries to solve the multiprocessor task-scheduling problem in a collective manner. Set of different experiments on various real-world taskgraphs has been done and archived results are so promising compared to the traditional methods and genetic algorithm.