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

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Li, J., Yang, F., Tu, G., Cao, W., & Lu, Y. (2007). Schedulability analysis of the fault-tolerant hard real-time tasks with limited priority levels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4610 LNCS, pp. 529–538). Springer Verlag. https://doi.org/10.1007/978-3-540-73547-2_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free