A better adaptive fault-tolerant scheduling (AFTS) algorithm for real-time tasks with dynamic security requirements

Current fault-tolerant scheduling algorithms have considered either the dynamic security requirement or the schedulability one of real-time task, but, to our best knowledge, not both together. Sections 1 and 2 of the full paper explain our AFTS algorithm, which we believe is better than existing ones and whose core consists of: "Firstly, it builds a real-time scheduling model, which is adaptive to dynamic security requirement, and the model describes in detail the scheduling process, including real-time tasks, system security services, and task fault-toleran-tance. Based on the model, it proposes a new AFTS algorithm which supports priority preemptive scheduling policy, and guarantees the schedulability of critical tasks at the cost of deferring normal tasks and adopts primary/backup copy technique to ensure fault-tolerance of critical tasks. The algorithm selects the best-fit security policy for schedulable task under updated system security level. ". Simulation results, presented in Fig. 1, and their analysis show preliminarily that the improvements in the adaptability to dynamic security level, the schedulability, and the fault-tolerance of critical task can indeed be achieved by using our AFTS algorithm.