A feasible schedulability analysis for fault-tolerant hard real-time systems

Hard real-time systems require predictable performance despite the occurrence of failures. In this paper, the authors proposed a new fault-tolerant priority assignment algorithm based on worst-case response time schedulability analysis for fault-tolerant hard real-time system. This algorithm can be used, together with the schedulability analysis, to effectively improve system fault resilience when the two traditional fault-tolerant priority assignment policies cannot improve system fault resilience. Also, a fault-tolerant priority configuration search algorithm for the proposed analysis was presented.