Schedulability analysis of the fault-tolerant hard real-time tasks with limited priority levels

Authors:
Jun Li;Fumin Yang;Gang Tu;Wanhua Cao;Yansheng Lu
Affiliations:
Department of Computer Science, HuaZhong University of Science and Technology, Wuhan, P.R. China;Department of Computer Science, HuaZhong University of Science and Technology, Wuhan, P.R. China;Department of Computer Science, HuaZhong University of Science and Technology, Wuhan, P.R. China;Wuhan Digital Engineering Institute, Wuhan, Hubei, P.R. China;Department of Computer Science, HuaZhong University of Science and Technology, Wuhan, P.R. China
Venue:
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Year:
2007

Citing 2
Cited 0

Performance of real-time bus scheduling algorithms

SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Fixed Priority Scheduling with Limited Priority Levels

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider fixed priority scheduling of fault-tolerant hard real-time tasks in which the priority level of the system is insufficient. This paper extends necessary and sufficient conditions for the purposed of limited priority levels on fault-tolerant hard real-time systems which takes into account the effect of temporary faults. The major contribution of our approach is to consider the recovery of tasks running with higher system priorities for the case of limited priority levels. This characteristic is very useful since the available slack time of higher system priority tasks can be make use of for recovering the faulty tasks of lower system priorities. Due to its flexibility and simplicity, the proposed approach provides an effective schedulability analysis, where the schedulability utilization of the system can be improved.