{'fraction_non_alphanumeric': 0.02252252252252252, 'fraction_numerical': 0.0036036036036036037, 'mean_word_length': 5.692771084337349, '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}}
Performability Comparison of Schedulability Conditions in Real-Time Embedded Systems

In modern safety-critical real-time embedded systems, performance and reliability are two most important parameters. The joint consideration of these two parameters is called performability. This paper evaluates and compares different schedulability conditions, which are used for scheduling tasks with fault-tolerant Rate-Monotonic (RM) algorithm, with respect to their performability. The task re-execution scheme is used to implement fault tolerance in the RM scheduling algorithm. To evaluate the schedulability conditions, a software tool is developed to simulate an embedded processor with m schedulable periodic tasks. The results show that among five different schedulability conditions used in this evaluation, the best schedulability condition has on average 3.5% higher performability than the time the other conditions are used. Also, the simulation results show that the next best schedulability condition can on average increase the performability of the embedded processor 2.5% more than the other conditions.