{'fraction_non_alphanumeric': 0.02320887991927346, 'fraction_numerical': 0.0, 'mean_word_length': 5.161490683229814, '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}}
Iterative Co-Scheduling of Tasks and Their Data Exchange Through Virtual Link-Based Packet Switched Network

During design of a real-time computer system, it is necessary to guarantee time-coordinated execution of computational tasks and data exchange between them. This goal is achieved by co-scheduling of tasks and data exchange. For systems based on packet switched networks with support for virtual links, co-scheduling is performed in several stages, including distribution of workload to CPU cores, construction of virtual links, and scheduling of computations on the cores. During sequential execution of these stages, one of the later stages may end up unsuccessful; in this case, it is reasonable to return to an earlier stage and execute it with corrected constraints. In this paper, we propose an iterative co-scheduling algorithm with support for such returns. Experimental evaluation results for this algorithm are presented. The algorithm is implemented in a software toolset.