{'fraction_non_alphanumeric': 0.038461538461538464, 'fraction_numerical': 0.0, 'mean_word_length': 4.843537414965986, '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}}
MSOF-DT Strategy and Its Impact on Real-Time Systems Scheduling

When managing Real-Time System execution, dynamic deadlines are problems that are not easy to handle. If a real-time computation is built using the traditional approach (Run-to-Completion), then there is no tolerance for the time of completion of the execution. Using the MSOF-DT computation strategy, the RT task can be more tolerant of the reduced processing time (deadline changes). Besides that, in this paper, we also propose a real-time process scheduling algorithm based on the MSOF-DT strategy, called EDSEF/MSOF-DT. The schedulability of the schedule produced by EDSEF/MSOF-DT can be better than the schedule generated by the EDF algorithm and also higher than using (Min_D+ Min_C) policy alone without MSOF-DT, both in cases without interruptions or cases that contain interruptions.