{'fraction_non_alphanumeric': 0.01262135922330097, 'fraction_numerical': 0.0, 'mean_word_length': 5.286585365853658, '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}}
An empirical study of permutational genetic crossover and mutation operators on the fixed priority assignment in distributed real-time systems

The assignment of fixed priorities to tasks and messages in distributed real-time systems is known to be an NP-hard problem, so there is no optimal method to accomplish it in polynomial time. Several generic search and optimization methods have been proposed in the literature for the priority-based scheduling of distributed real-time systems. The permutational genetic algorithm is one of those techniques that has shown a notable ability to solve this problem. The success of a genetic algorithm is greatly influenced by the used crossover and mutation operators, whose performance may vary between different problems. In this paper we make an introduction of some crossover and mutation operators for permutational genetic algorithms and make an experimental analysis of their performance in the assignment of fixed priorities to tasks and messages in distributed real-time systems.