{'fraction_non_alphanumeric': 0.025412960609911054, 'fraction_numerical': 0.0012706480304955528, 'mean_word_length': 5.354838709677419, '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}}
Exact schedulability analysis for single-rate periodic cyclic executives for a refined system model

Despite their industrial relevance, contemporary textbooks hardly address cyclic executives, if at all. There is therefore a need for analysis techniques for these executives.Earlier work considered exact schedulabilily analysis of basic single-rate cyclic executives for a basic system model. In this paper, we present exact schedulability analysis of a single-rate periodic cyclic executive, for a refined model in which the notion of observable event [1] is taken into account. We compare the single-rate periodic cyclic executive with the single-rate AFAP (as fast as possible) and single-rate time-driven AFAP cyclic executives from a scheduling perspective for this refined model.