{'fraction_non_alphanumeric': 0.024229074889867842, 'fraction_numerical': 0.0, 'mean_word_length': 5.232876712328767, '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}}
Task attribute-based scheduling: extending Ada's support for scheduling

Scheduling policies are of crucial importance to realtime systems. Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support new paradigms such as Earliest Deadline First (EDF), and combined paradigms. Possible extensions to the language in the form of new pragmas are described.