{'fraction_non_alphanumeric': 0.018329938900203666, 'fraction_numerical': 0.0, 'mean_word_length': 5.182389937106918, '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}}
An adaptive scheduling algorithm for fault-tolerant real-time systems

This paper is particularly concerned with the deadline mechanism, proposed as a means to design and implement fault-tolerant real-time systems. The computing system considered here uses a single-processor machine to run multiple software processes; each of them executes a task in response to periodic requests. Based on redundancy, the deadline mechanism assumes that every task is composed of primary and alternate algorithms. In such a context, the scheduling problem that arises amounts to ensuring timely completion of all the requests, either by primaries or alternates but preferably by primaries whenever possible. We present a heuristic scheduling strategy, which is optimal and runs in linear time. Because it is based on the accurate knowledge of processor activity at any point in time, its main property lies in its quick adaptivity and consequently its ability to cope with all runtime situations.