Fixed Priority Schedulability Analysis of a Distributed Real-Time Fault Tolerant Architecture.
Guillem Bernat, José Miró-Julià, Julián Proenza · 1997
This paper takes a distributed fault-tolerant architecture made of N real-time nodes and introduces schedulability tests for real-time systems running on this architecture. This architecture has been specifically designed to fulfill real-time and fault-tolerance requirements. Replicas of the real-time system are distributed on the the different nodes and interchange partial results for voting through a CAN-based communication link. The schedulability analysis presented is based on computing worst case response times of the tasks of the system. This includes the time for interchanging results and voting. Finally, it is shown that with this architecture it is possible not only to tolerate value faults but also timing faults to meet hard deadlines. Keywords: schedulability analysis, fault-tolerance, N-version programming, real-time systems 1