{'fraction_non_alphanumeric': 0.016611295681063124, 'fraction_numerical': 0.0, 'mean_word_length': 5.23448275862069, '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}}
A new method for optimization of allocation and scheduling in real time applications

Performance improvements achievable through parallel processing are useful in real time (RT) environments. The paper describes a method to map (i.e. allocate and schedule) a program with some RT constraints into a parallel system. We formulate the mapping problem as a minimization problem, defining a new cost function whose minimization leads to the optimal mapping of the program into the parallel system. The searching space over which the minimization must be carried out is defined; this space encloses all the feasible allocation and scheduling modalities for the program in the parallel system. The minimization is carried out through a simulated annealing algorithm, so we define an adjacency criterion on the searching space. Some examples illustrating the capabilities of the proposed method are presented.