{'fraction_non_alphanumeric': 0.016771488469601678, 'fraction_numerical': 0.0, 'mean_word_length': 4.858895705521473, '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}}
Computing the Maximum Blocking Time for Scheduling with Deferred Preemption

Deferred preemption enables a trade-off between the high dynamics of a preemptive schedule on the one hand, and the predictability of a non-preemptive system on the other hand. In addition to bounds on the execution time and the context-switch costs, the schedulability analysis for deferred preemption needs the maximum time a preemption can be delayed, called maximum blocking time. Scheduling theory is based on an abstraction level where these values are assumed to be given. So, the related work focuses on the scheduling analysis and not on the computation of the maximum blocking time. In this paper, we propose a new method to determine the maximum blocking time of a task given a fixed set of preemption points. To derive a sound upper bound, our approach also includes the safe determination of the context-switch costs which might increase the maximum blocking time.