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

Ping Xia, Xingshe Zhou, Bichang Xie

科研成果: 期刊稿件文章同行评审

摘要

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.

源语言英语
页(从-至)657-662
页数6
期刊Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University
30
5
出版状态已出版 - 10月 2012

指纹

探究 'A better adaptive fault-tolerant scheduling (AFTS) algorithm for real-time tasks with dynamic security requirements' 的科研主题。它们共同构成独一无二的指纹。

引用此