{'fraction_non_alphanumeric': 0.022202486678507993, 'fraction_numerical': 0.0, 'mean_word_length': 5.026737967914438, '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 Efficient Task Serializer for Hard Real-Time TMO Systems

Timeliness-guaranteed computing considering the worst case can hardly be accomplished at run time because of the uncertainty caused by resource sharing, asynchronous events and conflicting timing constraints between tasks. An easier way to reach it is to do some off-line analysis from design time with predictable characteristics of tasks. The TMO model supporting time-triggered (SpM) and message-triggered (SvM) member-threads is a well-known real-time object-oriented task model that aims the design-time guaranteed computing. In this paper, a new efficient task serializer that allocates the executions of time-triggered periodic tasks of multiple TMOs without delay and preemption to avoid resource conflicts is presented. The serializer tries to find scheduling scenarios in that each SpM is executed at its exact trigger-time without delay based on the given WCET. This is done by recasting the initial offsets of SpMs to avoid overlaps of executions. And several methods to handle SvMs according to the types of SvMs using the serializer are also proposed.