{'fraction_non_alphanumeric': 0.017543859649122806, 'fraction_numerical': 0.0, 'mean_word_length': 4.914634146341464, '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}}
Deriving period restrictions from a given utilization bound under RMS

We propose a new method to compute period choice restrictions based on a given maximum number of tasks in a task set, some pre-set period values, and a goal utilization bound ensuring the meeting of all deadlines under preemptive Rate-monotonic Scheduling (RMS) on a uniprocessor. The new approach is motivated by demonstrating that a safe utilization bound can be significantly increased by taking period configuration data into account. The two well-known approaches of the period-independent Liu/Layland bound and the harmonic chain method restriction which enforces new periods to be integer multiples or parts of pre-set periods are discussed. It will turn out that our new approach can serve as a trade-off balancing the two goals of a weak period choice restriction and a high utilization bound. Subsequently, we justify and demonstrate it by several examples and derive some rules of thumb.