{'fraction_non_alphanumeric': 0.0328719723183391, 'fraction_numerical': 0.0, 'mean_word_length': 5.50561797752809, '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}}
Schedulability-oriented code optimization of hard real-time multitasking systems

In multitasking hard real-time systems, each task’s response time must provably be lower than or equal to its deadline. If the system does not hold all timing constraints, WCEToriented optimizing compilers can be used to improve each task’s worst-case runtime behaviour. However, current optimizations do not account for a system’s schedulability contraints. We provide an approach based on Integer-Linear Programming (ILP) for schedulability-oriented WCET optimization of hard real-time systems.